./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label53.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label53.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 536fb035d928713a90d5c84a48f9ef94bf2f10bc408883dd0d7e11d670c7e07b --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 00:58:56,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 00:58:56,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 00:58:56,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 00:58:56,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 00:58:56,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 00:58:56,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 00:58:56,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 00:58:56,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 00:58:56,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 00:58:56,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 00:58:56,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 00:58:56,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 00:58:56,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 00:58:56,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 00:58:56,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 00:58:56,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 00:58:56,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 00:58:56,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 00:58:56,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 00:58:56,095 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 00:58:56,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 00:58:56,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 00:58:56,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 00:58:56,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 00:58:56,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 00:58:56,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 00:58:56,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 00:58:56,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 00:58:56,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 00:58:56,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 00:58:56,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 00:58:56,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 00:58:56,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 00:58:56,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 00:58:56,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 00:58:56,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 00:58:56,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 00:58:56,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 00:58:56,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 00:58:56,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 00:58:56,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 00:58:56,110 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 00:58:56,134 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 00:58:56,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 00:58:56,135 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 00:58:56,135 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 00:58:56,136 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 00:58:56,136 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 00:58:56,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 00:58:56,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 00:58:56,137 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 00:58:56,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 00:58:56,137 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 00:58:56,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 00:58:56,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 00:58:56,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 00:58:56,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 00:58:56,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 00:58:56,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 00:58:56,138 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 00:58:56,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 00:58:56,139 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 00:58:56,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 00:58:56,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 00:58:56,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 00:58:56,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 00:58:56,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 00:58:56,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 00:58:56,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 00:58:56,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 00:58:56,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 00:58:56,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 00:58:56,141 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 00:58:56,141 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 00:58:56,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 00:58:56,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 536fb035d928713a90d5c84a48f9ef94bf2f10bc408883dd0d7e11d670c7e07b [2022-07-12 00:58:56,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 00:58:56,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 00:58:56,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 00:58:56,315 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 00:58:56,316 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 00:58:56,316 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label53.c [2022-07-12 00:58:56,380 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ae9c51a/de0a5b2a00564de5a6d21cb827724d46/FLAG991584402 [2022-07-12 00:58:56,846 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 00:58:56,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label53.c [2022-07-12 00:58:56,855 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ae9c51a/de0a5b2a00564de5a6d21cb827724d46/FLAG991584402 [2022-07-12 00:58:56,863 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ae9c51a/de0a5b2a00564de5a6d21cb827724d46 [2022-07-12 00:58:56,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 00:58:56,866 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 00:58:56,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 00:58:56,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 00:58:56,883 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 00:58:56,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:58:56" (1/1) ... [2022-07-12 00:58:56,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d659bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:58:56, skipping insertion in model container [2022-07-12 00:58:56,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:58:56" (1/1) ... [2022-07-12 00:58:56,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 00:58:56,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 00:58:57,116 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/eca-rers2012/Problem11_label53.c[6841,6854] [2022-07-12 00:58:57,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 00:58:57,269 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 00:58:57,284 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/eca-rers2012/Problem11_label53.c[6841,6854] [2022-07-12 00:58:57,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 00:58:57,393 INFO L208 MainTranslator]: Completed translation [2022-07-12 00:58:57,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:58:57 WrapperNode [2022-07-12 00:58:57,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 00:58:57,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 00:58:57,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 00:58:57,395 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 00:58:57,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:58:57" (1/1) ... [2022-07-12 00:58:57,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:58:57" (1/1) ... [2022-07-12 00:58:57,488 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2022-07-12 00:58:57,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 00:58:57,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 00:58:57,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 00:58:57,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 00:58:57,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:58:57" (1/1) ... [2022-07-12 00:58:57,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:58:57" (1/1) ... [2022-07-12 00:58:57,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:58:57" (1/1) ... [2022-07-12 00:58:57,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:58:57" (1/1) ... [2022-07-12 00:58:57,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:58:57" (1/1) ... [2022-07-12 00:58:57,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:58:57" (1/1) ... [2022-07-12 00:58:57,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:58:57" (1/1) ... [2022-07-12 00:58:57,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 00:58:57,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 00:58:57,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 00:58:57,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 00:58:57,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:58:57" (1/1) ... [2022-07-12 00:58:57,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 00:58:57,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 00:58:57,599 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 00:58:57,628 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 00:58:57,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 00:58:57,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 00:58:57,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 00:58:57,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 00:58:57,692 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 00:58:57,693 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 00:58:58,734 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 00:58:58,745 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 00:58:58,745 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 00:58:58,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:58:58 BoogieIcfgContainer [2022-07-12 00:58:58,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 00:58:58,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 00:58:58,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 00:58:58,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 00:58:58,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:58:56" (1/3) ... [2022-07-12 00:58:58,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db0e750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:58:58, skipping insertion in model container [2022-07-12 00:58:58,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:58:57" (2/3) ... [2022-07-12 00:58:58,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db0e750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:58:58, skipping insertion in model container [2022-07-12 00:58:58,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:58:58" (3/3) ... [2022-07-12 00:58:58,756 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label53.c [2022-07-12 00:58:58,766 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 00:58:58,766 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 00:58:58,824 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 00:58:58,831 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@1854ddc3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@76c8f71b [2022-07-12 00:58:58,831 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 00:58:58,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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 00:58:58,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 00:58:58,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:58:58,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:58:58,850 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:58:58,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:58:58,854 INFO L85 PathProgramCache]: Analyzing trace with hash 433832817, now seen corresponding path program 1 times [2022-07-12 00:58:58,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:58:58,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199543837] [2022-07-12 00:58:58,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:58:58,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:58:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:58:59,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:58:59,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:58:59,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199543837] [2022-07-12 00:58:59,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199543837] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:58:59,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:58:59,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:58:59,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278836535] [2022-07-12 00:58:59,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:58:59,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:58:59,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:58:59,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:58:59,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:58:59,080 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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 00:58:59,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:58:59,834 INFO L93 Difference]: Finished difference Result 769 states and 1360 transitions. [2022-07-12 00:58:59,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:58:59,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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) Word has length 47 [2022-07-12 00:58:59,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:58:59,852 INFO L225 Difference]: With dead ends: 769 [2022-07-12 00:58:59,853 INFO L226 Difference]: Without dead ends: 422 [2022-07-12 00:58:59,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:58:59,873 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 193 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 00:58:59,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 163 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 00:58:59,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-07-12 00:58:59,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 412. [2022-07-12 00:58:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.5231143552311435) internal successors, (626), 411 states have internal predecessors, (626), 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 00:58:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 626 transitions. [2022-07-12 00:58:59,940 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 626 transitions. Word has length 47 [2022-07-12 00:58:59,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:58:59,941 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 626 transitions. [2022-07-12 00:58:59,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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 00:58:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 626 transitions. [2022-07-12 00:58:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 00:58:59,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:58:59,943 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 00:58:59,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 00:58:59,943 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:58:59,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:58:59,944 INFO L85 PathProgramCache]: Analyzing trace with hash 822269331, now seen corresponding path program 1 times [2022-07-12 00:58:59,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:58:59,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037408076] [2022-07-12 00:58:59,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:58:59,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:00,089 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:59:00,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:00,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037408076] [2022-07-12 00:59:00,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037408076] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:00,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:00,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:59:00,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928961417] [2022-07-12 00:59:00,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:00,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:59:00,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:00,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:59:00,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:00,092 INFO L87 Difference]: Start difference. First operand 412 states and 626 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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 00:59:00,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:00,626 INFO L93 Difference]: Finished difference Result 1194 states and 1821 transitions. [2022-07-12 00:59:00,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:59:00,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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) Word has length 113 [2022-07-12 00:59:00,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:00,629 INFO L225 Difference]: With dead ends: 1194 [2022-07-12 00:59:00,629 INFO L226 Difference]: Without dead ends: 784 [2022-07-12 00:59:00,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:00,631 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 175 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:00,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 154 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:59:00,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-07-12 00:59:00,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2022-07-12 00:59:00,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 783 states have (on average 1.3742017879948913) internal successors, (1076), 783 states have internal predecessors, (1076), 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 00:59:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1076 transitions. [2022-07-12 00:59:00,646 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1076 transitions. Word has length 113 [2022-07-12 00:59:00,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:00,646 INFO L495 AbstractCegarLoop]: Abstraction has 784 states and 1076 transitions. [2022-07-12 00:59:00,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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 00:59:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1076 transitions. [2022-07-12 00:59:00,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 00:59:00,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:00,649 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 00:59:00,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 00:59:00,650 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:00,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:00,650 INFO L85 PathProgramCache]: Analyzing trace with hash -995772387, now seen corresponding path program 1 times [2022-07-12 00:59:00,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:00,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538102124] [2022-07-12 00:59:00,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:00,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:59:00,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:00,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538102124] [2022-07-12 00:59:00,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538102124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:00,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:00,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:59:00,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936639374] [2022-07-12 00:59:00,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:00,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:59:00,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:00,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:59:00,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:00,746 INFO L87 Difference]: Start difference. First operand 784 states and 1076 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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 00:59:01,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:01,254 INFO L93 Difference]: Finished difference Result 1936 states and 2599 transitions. [2022-07-12 00:59:01,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:59:01,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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) Word has length 117 [2022-07-12 00:59:01,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:01,258 INFO L225 Difference]: With dead ends: 1936 [2022-07-12 00:59:01,258 INFO L226 Difference]: Without dead ends: 1154 [2022-07-12 00:59:01,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:01,260 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:01,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:59:01,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2022-07-12 00:59:01,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1153. [2022-07-12 00:59:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.2699652777777777) internal successors, (1463), 1152 states have internal predecessors, (1463), 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 00:59:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1463 transitions. [2022-07-12 00:59:01,275 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1463 transitions. Word has length 117 [2022-07-12 00:59:01,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:01,275 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1463 transitions. [2022-07-12 00:59:01,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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 00:59:01,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1463 transitions. [2022-07-12 00:59:01,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-12 00:59:01,279 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:01,279 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 00:59:01,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 00:59:01,279 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:01,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:01,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1474139372, now seen corresponding path program 1 times [2022-07-12 00:59:01,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:01,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213862061] [2022-07-12 00:59:01,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:01,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:01,353 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:59:01,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:01,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213862061] [2022-07-12 00:59:01,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213862061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:01,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:01,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:59:01,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487815712] [2022-07-12 00:59:01,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:01,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:59:01,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:01,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:59:01,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:01,356 INFO L87 Difference]: Start difference. First operand 1153 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 00:59:01,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:01,892 INFO L93 Difference]: Finished difference Result 2679 states and 3481 transitions. [2022-07-12 00:59:01,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:59:01,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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) Word has length 159 [2022-07-12 00:59:01,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:01,897 INFO L225 Difference]: With dead ends: 2679 [2022-07-12 00:59:01,897 INFO L226 Difference]: Without dead ends: 1712 [2022-07-12 00:59:01,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:01,899 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 159 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:01,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 332 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:59:01,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-07-12 00:59:01,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1521. [2022-07-12 00:59:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1520 states have (on average 1.255921052631579) internal successors, (1909), 1520 states have internal predecessors, (1909), 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 00:59:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1909 transitions. [2022-07-12 00:59:01,919 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1909 transitions. Word has length 159 [2022-07-12 00:59:01,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:01,920 INFO L495 AbstractCegarLoop]: Abstraction has 1521 states and 1909 transitions. [2022-07-12 00:59:01,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 00:59:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1909 transitions. [2022-07-12 00:59:01,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-07-12 00:59:01,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:01,922 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 00:59:01,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 00:59:01,923 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:01,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:01,923 INFO L85 PathProgramCache]: Analyzing trace with hash -47300224, now seen corresponding path program 1 times [2022-07-12 00:59:01,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:01,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130031046] [2022-07-12 00:59:01,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:01,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-12 00:59:02,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:02,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130031046] [2022-07-12 00:59:02,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130031046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:02,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:02,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:59:02,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747426965] [2022-07-12 00:59:02,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:02,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:59:02,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:02,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:59:02,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:02,056 INFO L87 Difference]: Start difference. First operand 1521 states and 1909 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 00:59:02,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:02,662 INFO L93 Difference]: Finished difference Result 3597 states and 4559 transitions. [2022-07-12 00:59:02,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:59:02,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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) Word has length 229 [2022-07-12 00:59:02,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:02,668 INFO L225 Difference]: With dead ends: 3597 [2022-07-12 00:59:02,669 INFO L226 Difference]: Without dead ends: 2078 [2022-07-12 00:59:02,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:02,674 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 150 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:02,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 391 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 00:59:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2022-07-12 00:59:02,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1889. [2022-07-12 00:59:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1888 states have (on average 1.2473516949152543) internal successors, (2355), 1888 states have internal predecessors, (2355), 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 00:59:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2355 transitions. [2022-07-12 00:59:02,697 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2355 transitions. Word has length 229 [2022-07-12 00:59:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:02,698 INFO L495 AbstractCegarLoop]: Abstraction has 1889 states and 2355 transitions. [2022-07-12 00:59:02,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 00:59:02,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2355 transitions. [2022-07-12 00:59:02,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-07-12 00:59:02,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:02,704 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 00:59:02,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 00:59:02,705 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:02,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:02,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1662120667, now seen corresponding path program 1 times [2022-07-12 00:59:02,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:02,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491214335] [2022-07-12 00:59:02,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:02,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:59:02,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:02,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491214335] [2022-07-12 00:59:02,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491214335] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:02,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:02,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:59:02,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406144620] [2022-07-12 00:59:02,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:02,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:59:02,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:02,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:59:02,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:02,845 INFO L87 Difference]: Start difference. First operand 1889 states and 2355 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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 00:59:03,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:03,400 INFO L93 Difference]: Finished difference Result 5075 states and 6326 transitions. [2022-07-12 00:59:03,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:59:03,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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) Word has length 256 [2022-07-12 00:59:03,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:03,408 INFO L225 Difference]: With dead ends: 5075 [2022-07-12 00:59:03,408 INFO L226 Difference]: Without dead ends: 3188 [2022-07-12 00:59:03,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:03,411 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 121 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:03,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 142 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:59:03,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2022-07-12 00:59:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 3186. [2022-07-12 00:59:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3186 states, 3185 states have (on average 1.2156985871271586) internal successors, (3872), 3185 states have internal predecessors, (3872), 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 00:59:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 3872 transitions. [2022-07-12 00:59:03,485 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 3872 transitions. Word has length 256 [2022-07-12 00:59:03,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:03,485 INFO L495 AbstractCegarLoop]: Abstraction has 3186 states and 3872 transitions. [2022-07-12 00:59:03,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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 00:59:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 3872 transitions. [2022-07-12 00:59:03,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2022-07-12 00:59:03,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:03,488 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 00:59:03,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 00:59:03,488 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:03,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:03,489 INFO L85 PathProgramCache]: Analyzing trace with hash -287769023, now seen corresponding path program 1 times [2022-07-12 00:59:03,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:03,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490963725] [2022-07-12 00:59:03,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:03,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-12 00:59:03,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:03,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490963725] [2022-07-12 00:59:03,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490963725] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:03,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:03,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:59:03,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603205320] [2022-07-12 00:59:03,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:03,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:59:03,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:03,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:59:03,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:03,591 INFO L87 Difference]: Start difference. First operand 3186 states and 3872 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 00:59:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:04,433 INFO L93 Difference]: Finished difference Result 6928 states and 8407 transitions. [2022-07-12 00:59:04,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:59:04,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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) Word has length 265 [2022-07-12 00:59:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:04,443 INFO L225 Difference]: With dead ends: 6928 [2022-07-12 00:59:04,443 INFO L226 Difference]: Without dead ends: 3744 [2022-07-12 00:59:04,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:04,446 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 173 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:04,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 140 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 00:59:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2022-07-12 00:59:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3186. [2022-07-12 00:59:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3186 states, 3185 states have (on average 1.2156985871271586) internal successors, (3872), 3185 states have internal predecessors, (3872), 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 00:59:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 3872 transitions. [2022-07-12 00:59:04,534 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 3872 transitions. Word has length 265 [2022-07-12 00:59:04,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:04,535 INFO L495 AbstractCegarLoop]: Abstraction has 3186 states and 3872 transitions. [2022-07-12 00:59:04,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 00:59:04,535 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 3872 transitions. [2022-07-12 00:59:04,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2022-07-12 00:59:04,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:04,551 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 00:59:04,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 00:59:04,552 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:04,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:04,552 INFO L85 PathProgramCache]: Analyzing trace with hash -592217694, now seen corresponding path program 1 times [2022-07-12 00:59:04,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:04,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886528912] [2022-07-12 00:59:04,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:04,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:59:04,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:04,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886528912] [2022-07-12 00:59:04,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886528912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:04,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:04,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 00:59:04,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630570761] [2022-07-12 00:59:04,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:04,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 00:59:04,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:04,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 00:59:04,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 00:59:04,688 INFO L87 Difference]: Start difference. First operand 3186 states and 3872 transitions. Second operand has 5 states, 5 states have (on average 53.2) internal successors, (266), 4 states have internal predecessors, (266), 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 00:59:06,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:06,517 INFO L93 Difference]: Finished difference Result 11357 states and 13866 transitions. [2022-07-12 00:59:06,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 00:59:06,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.2) internal successors, (266), 4 states have internal predecessors, (266), 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) Word has length 266 [2022-07-12 00:59:06,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:06,536 INFO L225 Difference]: With dead ends: 11357 [2022-07-12 00:59:06,536 INFO L226 Difference]: Without dead ends: 8173 [2022-07-12 00:59:06,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 00:59:06,541 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 383 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1888 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 2206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:06,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 151 Invalid, 2206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1888 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-12 00:59:06,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8173 states. [2022-07-12 00:59:06,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8173 to 7978. [2022-07-12 00:59:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7978 states, 7977 states have (on average 1.184655885671305) internal successors, (9450), 7977 states have internal predecessors, (9450), 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 00:59:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7978 states to 7978 states and 9450 transitions. [2022-07-12 00:59:06,649 INFO L78 Accepts]: Start accepts. Automaton has 7978 states and 9450 transitions. Word has length 266 [2022-07-12 00:59:06,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:06,649 INFO L495 AbstractCegarLoop]: Abstraction has 7978 states and 9450 transitions. [2022-07-12 00:59:06,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.2) internal successors, (266), 4 states have internal predecessors, (266), 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 00:59:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 7978 states and 9450 transitions. [2022-07-12 00:59:06,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-12 00:59:06,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:06,653 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 00:59:06,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 00:59:06,654 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:06,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:06,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1968548590, now seen corresponding path program 1 times [2022-07-12 00:59:06,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:06,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661220448] [2022-07-12 00:59:06,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:06,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:06,736 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:59:06,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:06,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661220448] [2022-07-12 00:59:06,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661220448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:06,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:06,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:59:06,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561702256] [2022-07-12 00:59:06,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:06,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:59:06,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:06,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:59:06,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:06,739 INFO L87 Difference]: Start difference. First operand 7978 states and 9450 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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 00:59:07,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:07,347 INFO L93 Difference]: Finished difference Result 15584 states and 18510 transitions. [2022-07-12 00:59:07,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:59:07,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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) Word has length 271 [2022-07-12 00:59:07,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:07,374 INFO L225 Difference]: With dead ends: 15584 [2022-07-12 00:59:07,374 INFO L226 Difference]: Without dead ends: 7976 [2022-07-12 00:59:07,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:07,383 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 136 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:07,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 304 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 00:59:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2022-07-12 00:59:07,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7792. [2022-07-12 00:59:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7792 states, 7791 states have (on average 1.145295854190733) internal successors, (8923), 7791 states have internal predecessors, (8923), 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 00:59:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7792 states to 7792 states and 8923 transitions. [2022-07-12 00:59:07,485 INFO L78 Accepts]: Start accepts. Automaton has 7792 states and 8923 transitions. Word has length 271 [2022-07-12 00:59:07,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:07,486 INFO L495 AbstractCegarLoop]: Abstraction has 7792 states and 8923 transitions. [2022-07-12 00:59:07,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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 00:59:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 7792 states and 8923 transitions. [2022-07-12 00:59:07,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-07-12 00:59:07,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:07,490 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 00:59:07,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 00:59:07,491 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:07,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:07,494 INFO L85 PathProgramCache]: Analyzing trace with hash 63284525, now seen corresponding path program 1 times [2022-07-12 00:59:07,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:07,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007092779] [2022-07-12 00:59:07,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:07,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:07,596 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:59:07,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:07,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007092779] [2022-07-12 00:59:07,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007092779] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:07,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:07,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 00:59:07,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922680015] [2022-07-12 00:59:07,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:07,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 00:59:07,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:07,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 00:59:07,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:59:07,598 INFO L87 Difference]: Start difference. First operand 7792 states and 8923 transitions. Second operand has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 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 00:59:08,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:08,554 INFO L93 Difference]: Finished difference Result 17060 states and 19558 transitions. [2022-07-12 00:59:08,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 00:59:08,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 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) Word has length 283 [2022-07-12 00:59:08,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:08,566 INFO L225 Difference]: With dead ends: 17060 [2022-07-12 00:59:08,566 INFO L226 Difference]: Without dead ends: 9638 [2022-07-12 00:59:08,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:59:08,573 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 270 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:08,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 96 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 00:59:08,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9638 states. [2022-07-12 00:59:08,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9638 to 9632. [2022-07-12 00:59:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9632 states, 9631 states have (on average 1.1318658498598277) internal successors, (10901), 9631 states have internal predecessors, (10901), 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 00:59:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9632 states to 9632 states and 10901 transitions. [2022-07-12 00:59:08,653 INFO L78 Accepts]: Start accepts. Automaton has 9632 states and 10901 transitions. Word has length 283 [2022-07-12 00:59:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:08,653 INFO L495 AbstractCegarLoop]: Abstraction has 9632 states and 10901 transitions. [2022-07-12 00:59:08,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 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 00:59:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 9632 states and 10901 transitions. [2022-07-12 00:59:08,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2022-07-12 00:59:08,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:08,658 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 00:59:08,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 00:59:08,659 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:08,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:08,659 INFO L85 PathProgramCache]: Analyzing trace with hash 240124637, now seen corresponding path program 1 times [2022-07-12 00:59:08,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:08,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937496872] [2022-07-12 00:59:08,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:08,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:08,772 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-07-12 00:59:08,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:08,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937496872] [2022-07-12 00:59:08,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937496872] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:08,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:08,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:59:08,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613625648] [2022-07-12 00:59:08,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:08,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:59:08,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:08,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:59:08,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:08,775 INFO L87 Difference]: Start difference. First operand 9632 states and 10901 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 00:59:09,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:09,303 INFO L93 Difference]: Finished difference Result 19631 states and 22247 transitions. [2022-07-12 00:59:09,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:59:09,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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) Word has length 315 [2022-07-12 00:59:09,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:09,314 INFO L225 Difference]: With dead ends: 19631 [2022-07-12 00:59:09,314 INFO L226 Difference]: Without dead ends: 10369 [2022-07-12 00:59:09,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:09,322 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 172 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:09,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 124 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:59:09,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10369 states. [2022-07-12 00:59:09,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10369 to 8888. [2022-07-12 00:59:09,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8888 states, 8887 states have (on average 1.1301901654101496) internal successors, (10044), 8887 states have internal predecessors, (10044), 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 00:59:09,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8888 states to 8888 states and 10044 transitions. [2022-07-12 00:59:09,401 INFO L78 Accepts]: Start accepts. Automaton has 8888 states and 10044 transitions. Word has length 315 [2022-07-12 00:59:09,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:09,401 INFO L495 AbstractCegarLoop]: Abstraction has 8888 states and 10044 transitions. [2022-07-12 00:59:09,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 00:59:09,402 INFO L276 IsEmpty]: Start isEmpty. Operand 8888 states and 10044 transitions. [2022-07-12 00:59:09,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2022-07-12 00:59:09,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:09,412 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 00:59:09,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 00:59:09,412 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:09,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:09,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1241149180, now seen corresponding path program 1 times [2022-07-12 00:59:09,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:09,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192075274] [2022-07-12 00:59:09,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:09,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:09,565 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-12 00:59:09,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:09,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192075274] [2022-07-12 00:59:09,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192075274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:09,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:09,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:59:09,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402954532] [2022-07-12 00:59:09,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:09,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:59:09,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:09,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:59:09,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:09,568 INFO L87 Difference]: Start difference. First operand 8888 states and 10044 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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 00:59:10,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:10,104 INFO L93 Difference]: Finished difference Result 18334 states and 20776 transitions. [2022-07-12 00:59:10,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:59:10,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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) Word has length 412 [2022-07-12 00:59:10,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:10,115 INFO L225 Difference]: With dead ends: 18334 [2022-07-12 00:59:10,115 INFO L226 Difference]: Without dead ends: 9816 [2022-07-12 00:59:10,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:10,122 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 65 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:10,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 363 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:59:10,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9816 states. [2022-07-12 00:59:10,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9816 to 9813. [2022-07-12 00:59:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9813 states, 9812 states have (on average 1.1271911944557684) internal successors, (11060), 9812 states have internal predecessors, (11060), 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 00:59:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9813 states to 9813 states and 11060 transitions. [2022-07-12 00:59:10,200 INFO L78 Accepts]: Start accepts. Automaton has 9813 states and 11060 transitions. Word has length 412 [2022-07-12 00:59:10,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:10,201 INFO L495 AbstractCegarLoop]: Abstraction has 9813 states and 11060 transitions. [2022-07-12 00:59:10,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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 00:59:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 9813 states and 11060 transitions. [2022-07-12 00:59:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2022-07-12 00:59:10,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:10,212 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 00:59:10,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 00:59:10,235 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:10,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:10,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1908588689, now seen corresponding path program 1 times [2022-07-12 00:59:10,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:10,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976970003] [2022-07-12 00:59:10,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:10,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:10,399 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 462 proven. 78 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-07-12 00:59:10,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:10,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976970003] [2022-07-12 00:59:10,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976970003] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 00:59:10,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564758837] [2022-07-12 00:59:10,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:10,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 00:59:10,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 00:59:10,402 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 00:59:10,404 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 00:59:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:10,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 00:59:10,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 00:59:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-07-12 00:59:10,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 00:59:10,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564758837] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:10,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 00:59:10,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-12 00:59:10,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102232256] [2022-07-12 00:59:10,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:10,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:59:10,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:10,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:59:10,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 00:59:10,730 INFO L87 Difference]: Start difference. First operand 9813 states and 11060 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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 00:59:11,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:11,339 INFO L93 Difference]: Finished difference Result 19441 states and 21929 transitions. [2022-07-12 00:59:11,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:59:11,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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) Word has length 416 [2022-07-12 00:59:11,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:11,350 INFO L225 Difference]: With dead ends: 19441 [2022-07-12 00:59:11,350 INFO L226 Difference]: Without dead ends: 9998 [2022-07-12 00:59:11,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 00:59:11,356 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 127 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:11,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 173 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:59:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9998 states. [2022-07-12 00:59:11,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9998 to 9813. [2022-07-12 00:59:11,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9813 states, 9812 states have (on average 1.1229107215654301) internal successors, (11018), 9812 states have internal predecessors, (11018), 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 00:59:11,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9813 states to 9813 states and 11018 transitions. [2022-07-12 00:59:11,434 INFO L78 Accepts]: Start accepts. Automaton has 9813 states and 11018 transitions. Word has length 416 [2022-07-12 00:59:11,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:11,434 INFO L495 AbstractCegarLoop]: Abstraction has 9813 states and 11018 transitions. [2022-07-12 00:59:11,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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 00:59:11,435 INFO L276 IsEmpty]: Start isEmpty. Operand 9813 states and 11018 transitions. [2022-07-12 00:59:11,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2022-07-12 00:59:11,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:11,445 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-07-12 00:59:11,464 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 00:59:11,661 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,SelfDestructingSolverStorable12 [2022-07-12 00:59:11,662 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:11,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:11,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1076489507, now seen corresponding path program 1 times [2022-07-12 00:59:11,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:11,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469997587] [2022-07-12 00:59:11,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:11,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 00:59:11,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:11,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469997587] [2022-07-12 00:59:11,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469997587] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:11,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:11,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 00:59:11,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630982557] [2022-07-12 00:59:11,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:11,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 00:59:11,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:11,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 00:59:11,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 00:59:11,910 INFO L87 Difference]: Start difference. First operand 9813 states and 11018 transitions. Second operand has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 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 00:59:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:13,241 INFO L93 Difference]: Finished difference Result 22949 states and 25728 transitions. [2022-07-12 00:59:13,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 00:59:13,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 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) Word has length 417 [2022-07-12 00:59:13,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:13,261 INFO L225 Difference]: With dead ends: 22949 [2022-07-12 00:59:13,262 INFO L226 Difference]: Without dead ends: 13506 [2022-07-12 00:59:13,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-12 00:59:13,273 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 310 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 2087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:13,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 218 Invalid, 2087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 00:59:13,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13506 states. [2022-07-12 00:59:13,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13506 to 12944. [2022-07-12 00:59:13,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12944 states, 12943 states have (on average 1.1209920420304411) internal successors, (14509), 12943 states have internal predecessors, (14509), 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 00:59:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12944 states to 12944 states and 14509 transitions. [2022-07-12 00:59:13,470 INFO L78 Accepts]: Start accepts. Automaton has 12944 states and 14509 transitions. Word has length 417 [2022-07-12 00:59:13,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:13,470 INFO L495 AbstractCegarLoop]: Abstraction has 12944 states and 14509 transitions. [2022-07-12 00:59:13,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 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 00:59:13,471 INFO L276 IsEmpty]: Start isEmpty. Operand 12944 states and 14509 transitions. [2022-07-12 00:59:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2022-07-12 00:59:13,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:13,482 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-07-12 00:59:13,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 00:59:13,483 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:13,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:13,483 INFO L85 PathProgramCache]: Analyzing trace with hash 835183340, now seen corresponding path program 1 times [2022-07-12 00:59:13,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:13,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53751494] [2022-07-12 00:59:13,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:13,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-07-12 00:59:13,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:13,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53751494] [2022-07-12 00:59:13,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53751494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:13,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:13,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:59:13,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062265939] [2022-07-12 00:59:13,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:13,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:59:13,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:13,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:59:13,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:13,617 INFO L87 Difference]: Start difference. First operand 12944 states and 14509 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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 00:59:14,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:14,313 INFO L93 Difference]: Finished difference Result 28094 states and 31494 transitions. [2022-07-12 00:59:14,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:59:14,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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) Word has length 418 [2022-07-12 00:59:14,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:14,330 INFO L225 Difference]: With dead ends: 28094 [2022-07-12 00:59:14,330 INFO L226 Difference]: Without dead ends: 13491 [2022-07-12 00:59:14,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:14,341 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 122 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:14,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 323 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 00:59:14,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13491 states. [2022-07-12 00:59:14,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13491 to 13491. [2022-07-12 00:59:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13491 states, 13490 states have (on average 1.1066716085989623) internal successors, (14929), 13490 states have internal predecessors, (14929), 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 00:59:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13491 states to 13491 states and 14929 transitions. [2022-07-12 00:59:14,564 INFO L78 Accepts]: Start accepts. Automaton has 13491 states and 14929 transitions. Word has length 418 [2022-07-12 00:59:14,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:14,564 INFO L495 AbstractCegarLoop]: Abstraction has 13491 states and 14929 transitions. [2022-07-12 00:59:14,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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 00:59:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 13491 states and 14929 transitions. [2022-07-12 00:59:14,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2022-07-12 00:59:14,575 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:14,575 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-07-12 00:59:14,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 00:59:14,575 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:14,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:14,576 INFO L85 PathProgramCache]: Analyzing trace with hash -740708408, now seen corresponding path program 1 times [2022-07-12 00:59:14,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:14,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780870608] [2022-07-12 00:59:14,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:14,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:14,673 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2022-07-12 00:59:14,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:14,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780870608] [2022-07-12 00:59:14,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780870608] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:14,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:14,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:59:14,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261505627] [2022-07-12 00:59:14,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:14,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:59:14,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:14,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:59:14,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:14,676 INFO L87 Difference]: Start difference. First operand 13491 states and 14929 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 00:59:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:15,222 INFO L93 Difference]: Finished difference Result 27899 states and 30921 transitions. [2022-07-12 00:59:15,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:59:15,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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) Word has length 426 [2022-07-12 00:59:15,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:15,241 INFO L225 Difference]: With dead ends: 27899 [2022-07-12 00:59:15,241 INFO L226 Difference]: Without dead ends: 14778 [2022-07-12 00:59:15,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:15,250 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 199 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:15,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 341 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:59:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14778 states. [2022-07-12 00:59:15,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14778 to 14594. [2022-07-12 00:59:15,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14594 states, 14593 states have (on average 1.1035427944905092) internal successors, (16104), 14593 states have internal predecessors, (16104), 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 00:59:15,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14594 states to 14594 states and 16104 transitions. [2022-07-12 00:59:15,474 INFO L78 Accepts]: Start accepts. Automaton has 14594 states and 16104 transitions. Word has length 426 [2022-07-12 00:59:15,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:15,474 INFO L495 AbstractCegarLoop]: Abstraction has 14594 states and 16104 transitions. [2022-07-12 00:59:15,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 00:59:15,474 INFO L276 IsEmpty]: Start isEmpty. Operand 14594 states and 16104 transitions. [2022-07-12 00:59:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2022-07-12 00:59:15,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:15,489 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 00:59:15,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 00:59:15,489 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:15,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:15,489 INFO L85 PathProgramCache]: Analyzing trace with hash -406320324, now seen corresponding path program 1 times [2022-07-12 00:59:15,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:15,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620814125] [2022-07-12 00:59:15,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:15,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 395 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 00:59:15,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:15,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620814125] [2022-07-12 00:59:15,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620814125] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 00:59:15,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121071666] [2022-07-12 00:59:15,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:15,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 00:59:15,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 00:59:15,723 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 00:59:15,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 00:59:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:15,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 00:59:15,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 00:59:16,717 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 282 proven. 121 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 00:59:16,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 00:59:19,005 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 282 proven. 121 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 00:59:19,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121071666] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 00:59:19,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 00:59:19,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2022-07-12 00:59:19,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417319212] [2022-07-12 00:59:19,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 00:59:19,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 00:59:19,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:19,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 00:59:19,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-12 00:59:19,008 INFO L87 Difference]: Start difference. First operand 14594 states and 16104 transitions. Second operand has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 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 00:59:22,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:22,862 INFO L93 Difference]: Finished difference Result 34968 states and 38363 transitions. [2022-07-12 00:59:22,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-12 00:59:22,863 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 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) Word has length 427 [2022-07-12 00:59:22,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:22,887 INFO L225 Difference]: With dead ends: 34968 [2022-07-12 00:59:22,887 INFO L226 Difference]: Without dead ends: 20181 [2022-07-12 00:59:22,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 885 GetRequests, 849 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=363, Invalid=969, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 00:59:22,897 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1301 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 4459 mSolverCounterSat, 891 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1301 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 5350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 891 IncrementalHoareTripleChecker+Valid, 4459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:22,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1301 Valid, 196 Invalid, 5350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [891 Valid, 4459 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-12 00:59:22,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20181 states. [2022-07-12 00:59:23,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20181 to 12562. [2022-07-12 00:59:23,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12562 states, 12561 states have (on average 1.0829551787278082) internal successors, (13603), 12561 states have internal predecessors, (13603), 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 00:59:23,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12562 states to 12562 states and 13603 transitions. [2022-07-12 00:59:23,040 INFO L78 Accepts]: Start accepts. Automaton has 12562 states and 13603 transitions. Word has length 427 [2022-07-12 00:59:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:23,041 INFO L495 AbstractCegarLoop]: Abstraction has 12562 states and 13603 transitions. [2022-07-12 00:59:23,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 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 00:59:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 12562 states and 13603 transitions. [2022-07-12 00:59:23,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2022-07-12 00:59:23,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:23,051 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2022-07-12 00:59:23,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 00:59:23,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 00:59:23,268 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:23,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:23,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1378519044, now seen corresponding path program 1 times [2022-07-12 00:59:23,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:23,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798877870] [2022-07-12 00:59:23,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:23,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2022-07-12 00:59:23,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:23,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798877870] [2022-07-12 00:59:23,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798877870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:23,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:23,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:59:23,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536851535] [2022-07-12 00:59:23,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:23,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:59:23,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:23,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:59:23,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:23,380 INFO L87 Difference]: Start difference. First operand 12562 states and 13603 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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 00:59:23,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:23,855 INFO L93 Difference]: Finished difference Result 26225 states and 28444 transitions. [2022-07-12 00:59:23,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:59:23,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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) Word has length 438 [2022-07-12 00:59:23,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:23,866 INFO L225 Difference]: With dead ends: 26225 [2022-07-12 00:59:23,867 INFO L226 Difference]: Without dead ends: 14033 [2022-07-12 00:59:23,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:23,873 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 173 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:23,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 112 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 00:59:23,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14033 states. [2022-07-12 00:59:23,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14033 to 12377. [2022-07-12 00:59:23,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12377 states, 12376 states have (on average 1.083710407239819) internal successors, (13412), 12376 states have internal predecessors, (13412), 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 00:59:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12377 states to 12377 states and 13412 transitions. [2022-07-12 00:59:23,999 INFO L78 Accepts]: Start accepts. Automaton has 12377 states and 13412 transitions. Word has length 438 [2022-07-12 00:59:23,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:23,999 INFO L495 AbstractCegarLoop]: Abstraction has 12377 states and 13412 transitions. [2022-07-12 00:59:24,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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 00:59:24,000 INFO L276 IsEmpty]: Start isEmpty. Operand 12377 states and 13412 transitions. [2022-07-12 00:59:24,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2022-07-12 00:59:24,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:24,008 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 00:59:24,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 00:59:24,008 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:24,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:24,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1889494746, now seen corresponding path program 1 times [2022-07-12 00:59:24,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:24,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878583694] [2022-07-12 00:59:24,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:24,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 469 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:59:24,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:24,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878583694] [2022-07-12 00:59:24,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878583694] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:24,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:24,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 00:59:24,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918927201] [2022-07-12 00:59:24,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:24,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 00:59:24,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:24,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 00:59:24,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:59:24,193 INFO L87 Difference]: Start difference. First operand 12377 states and 13412 transitions. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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 00:59:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:25,077 INFO L93 Difference]: Finished difference Result 26600 states and 28818 transitions. [2022-07-12 00:59:25,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 00:59:25,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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) Word has length 449 [2022-07-12 00:59:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:25,090 INFO L225 Difference]: With dead ends: 26600 [2022-07-12 00:59:25,090 INFO L226 Difference]: Without dead ends: 14593 [2022-07-12 00:59:25,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:59:25,098 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 175 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:25,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 58 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 00:59:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14593 states. [2022-07-12 00:59:25,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14593 to 13299. [2022-07-12 00:59:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13299 states, 13298 states have (on average 1.0792600391036247) internal successors, (14352), 13298 states have internal predecessors, (14352), 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 00:59:25,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13299 states to 13299 states and 14352 transitions. [2022-07-12 00:59:25,225 INFO L78 Accepts]: Start accepts. Automaton has 13299 states and 14352 transitions. Word has length 449 [2022-07-12 00:59:25,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:25,225 INFO L495 AbstractCegarLoop]: Abstraction has 13299 states and 14352 transitions. [2022-07-12 00:59:25,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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 00:59:25,225 INFO L276 IsEmpty]: Start isEmpty. Operand 13299 states and 14352 transitions. [2022-07-12 00:59:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2022-07-12 00:59:25,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:25,233 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 00:59:25,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 00:59:25,233 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:25,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:25,234 INFO L85 PathProgramCache]: Analyzing trace with hash 630362065, now seen corresponding path program 1 times [2022-07-12 00:59:25,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:25,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039985153] [2022-07-12 00:59:25,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:25,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:25,358 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-07-12 00:59:25,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:25,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039985153] [2022-07-12 00:59:25,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039985153] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:25,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:25,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:59:25,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712264808] [2022-07-12 00:59:25,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:25,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:59:25,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:25,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:59:25,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:25,359 INFO L87 Difference]: Start difference. First operand 13299 states and 14352 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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 00:59:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:25,903 INFO L93 Difference]: Finished difference Result 27700 states and 29888 transitions. [2022-07-12 00:59:25,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:59:25,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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) Word has length 464 [2022-07-12 00:59:25,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:25,916 INFO L225 Difference]: With dead ends: 27700 [2022-07-12 00:59:25,916 INFO L226 Difference]: Without dead ends: 12930 [2022-07-12 00:59:25,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:25,925 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 109 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:25,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 290 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:59:25,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12930 states. [2022-07-12 00:59:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12930 to 12009. [2022-07-12 00:59:26,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12009 states, 12008 states have (on average 1.0646235842771485) internal successors, (12784), 12008 states have internal predecessors, (12784), 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 00:59:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12009 states to 12009 states and 12784 transitions. [2022-07-12 00:59:26,125 INFO L78 Accepts]: Start accepts. Automaton has 12009 states and 12784 transitions. Word has length 464 [2022-07-12 00:59:26,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:26,139 INFO L495 AbstractCegarLoop]: Abstraction has 12009 states and 12784 transitions. [2022-07-12 00:59:26,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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 00:59:26,140 INFO L276 IsEmpty]: Start isEmpty. Operand 12009 states and 12784 transitions. [2022-07-12 00:59:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2022-07-12 00:59:26,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:26,154 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-07-12 00:59:26,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 00:59:26,154 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:26,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:26,155 INFO L85 PathProgramCache]: Analyzing trace with hash -13761946, now seen corresponding path program 1 times [2022-07-12 00:59:26,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:26,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33137066] [2022-07-12 00:59:26,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:26,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:26,376 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 535 proven. 162 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-12 00:59:26,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:26,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33137066] [2022-07-12 00:59:26,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33137066] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 00:59:26,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105187446] [2022-07-12 00:59:26,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:26,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 00:59:26,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 00:59:26,391 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 00:59:26,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 00:59:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:26,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 00:59:26,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 00:59:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-12 00:59:26,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 00:59:26,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105187446] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:26,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 00:59:26,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2022-07-12 00:59:26,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909332343] [2022-07-12 00:59:26,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:26,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:59:26,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:26,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:59:26,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 00:59:26,745 INFO L87 Difference]: Start difference. First operand 12009 states and 12784 transitions. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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 00:59:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:27,182 INFO L93 Difference]: Finished difference Result 23836 states and 25386 transitions. [2022-07-12 00:59:27,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:59:27,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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) Word has length 502 [2022-07-12 00:59:27,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:27,192 INFO L225 Difference]: With dead ends: 23836 [2022-07-12 00:59:27,193 INFO L226 Difference]: Without dead ends: 12013 [2022-07-12 00:59:27,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 00:59:27,200 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 72 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:27,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 323 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 00:59:27,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12013 states. [2022-07-12 00:59:27,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12013 to 12009. [2022-07-12 00:59:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12009 states, 12008 states have (on average 1.0542971352431711) internal successors, (12660), 12008 states have internal predecessors, (12660), 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 00:59:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12009 states to 12009 states and 12660 transitions. [2022-07-12 00:59:27,298 INFO L78 Accepts]: Start accepts. Automaton has 12009 states and 12660 transitions. Word has length 502 [2022-07-12 00:59:27,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:27,298 INFO L495 AbstractCegarLoop]: Abstraction has 12009 states and 12660 transitions. [2022-07-12 00:59:27,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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 00:59:27,298 INFO L276 IsEmpty]: Start isEmpty. Operand 12009 states and 12660 transitions. [2022-07-12 00:59:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2022-07-12 00:59:27,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:27,306 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 00:59:27,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 00:59:27,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 00:59:27,520 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:27,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:27,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1083232953, now seen corresponding path program 1 times [2022-07-12 00:59:27,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:27,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641837468] [2022-07-12 00:59:27,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:27,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:27,710 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 609 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-07-12 00:59:27,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:27,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641837468] [2022-07-12 00:59:27,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641837468] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:27,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:27,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:59:27,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49815848] [2022-07-12 00:59:27,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:27,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 00:59:27,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:27,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 00:59:27,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:59:27,712 INFO L87 Difference]: Start difference. First operand 12009 states and 12660 transitions. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 3 states have internal predecessors, (366), 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 00:59:28,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:28,534 INFO L93 Difference]: Finished difference Result 30656 states and 32329 transitions. [2022-07-12 00:59:28,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 00:59:28,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 3 states have internal predecessors, (366), 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) Word has length 506 [2022-07-12 00:59:28,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:28,551 INFO L225 Difference]: With dead ends: 30656 [2022-07-12 00:59:28,551 INFO L226 Difference]: Without dead ends: 18833 [2022-07-12 00:59:28,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:59:28,561 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 197 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:28,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 75 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 00:59:28,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18833 states. [2022-07-12 00:59:28,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18833 to 16433. [2022-07-12 00:59:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16433 states, 16432 states have (on average 1.0527020447906523) internal successors, (17298), 16432 states have internal predecessors, (17298), 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 00:59:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16433 states to 16433 states and 17298 transitions. [2022-07-12 00:59:28,758 INFO L78 Accepts]: Start accepts. Automaton has 16433 states and 17298 transitions. Word has length 506 [2022-07-12 00:59:28,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:28,758 INFO L495 AbstractCegarLoop]: Abstraction has 16433 states and 17298 transitions. [2022-07-12 00:59:28,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 3 states have internal predecessors, (366), 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 00:59:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 16433 states and 17298 transitions. [2022-07-12 00:59:28,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2022-07-12 00:59:28,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:28,768 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 00:59:28,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 00:59:28,768 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:28,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:28,768 INFO L85 PathProgramCache]: Analyzing trace with hash 450076133, now seen corresponding path program 1 times [2022-07-12 00:59:28,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:28,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563361676] [2022-07-12 00:59:28,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:28,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-07-12 00:59:28,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:28,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563361676] [2022-07-12 00:59:28,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563361676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:28,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:28,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:59:28,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138705514] [2022-07-12 00:59:28,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:28,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 00:59:28,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:28,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 00:59:28,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:59:28,887 INFO L87 Difference]: Start difference. First operand 16433 states and 17298 transitions. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 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 00:59:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:29,679 INFO L93 Difference]: Finished difference Result 31766 states and 33487 transitions. [2022-07-12 00:59:29,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 00:59:29,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 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) Word has length 530 [2022-07-12 00:59:29,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:29,695 INFO L225 Difference]: With dead ends: 31766 [2022-07-12 00:59:29,695 INFO L226 Difference]: Without dead ends: 17177 [2022-07-12 00:59:29,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:59:29,707 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 220 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:29,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 89 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 00:59:29,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17177 states. [2022-07-12 00:59:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17177 to 16803. [2022-07-12 00:59:29,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16803 states, 16802 states have (on average 1.0520771336745625) internal successors, (17677), 16802 states have internal predecessors, (17677), 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 00:59:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16803 states to 16803 states and 17677 transitions. [2022-07-12 00:59:29,864 INFO L78 Accepts]: Start accepts. Automaton has 16803 states and 17677 transitions. Word has length 530 [2022-07-12 00:59:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:29,864 INFO L495 AbstractCegarLoop]: Abstraction has 16803 states and 17677 transitions. [2022-07-12 00:59:29,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 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 00:59:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 16803 states and 17677 transitions. [2022-07-12 00:59:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2022-07-12 00:59:29,874 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:29,874 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 00:59:29,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 00:59:29,874 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:29,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:29,875 INFO L85 PathProgramCache]: Analyzing trace with hash -415550207, now seen corresponding path program 1 times [2022-07-12 00:59:29,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:29,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421196380] [2022-07-12 00:59:29,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:29,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1165 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2022-07-12 00:59:30,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:30,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421196380] [2022-07-12 00:59:30,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421196380] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:30,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:30,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:59:30,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837165875] [2022-07-12 00:59:30,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:30,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:59:30,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:30,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:59:30,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:30,045 INFO L87 Difference]: Start difference. First operand 16803 states and 17677 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 00:59:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:30,498 INFO L93 Difference]: Finished difference Result 31577 states and 33242 transitions. [2022-07-12 00:59:30,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:59:30,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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) Word has length 583 [2022-07-12 00:59:30,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:30,513 INFO L225 Difference]: With dead ends: 31577 [2022-07-12 00:59:30,514 INFO L226 Difference]: Without dead ends: 16618 [2022-07-12 00:59:30,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:30,524 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 191 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:30,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 313 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 00:59:30,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16618 states. [2022-07-12 00:59:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16618 to 16618. [2022-07-12 00:59:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16618 states, 16617 states have (on average 1.0513931515917434) internal successors, (17471), 16617 states have internal predecessors, (17471), 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 00:59:30,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16618 states to 16618 states and 17471 transitions. [2022-07-12 00:59:30,675 INFO L78 Accepts]: Start accepts. Automaton has 16618 states and 17471 transitions. Word has length 583 [2022-07-12 00:59:30,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:30,676 INFO L495 AbstractCegarLoop]: Abstraction has 16618 states and 17471 transitions. [2022-07-12 00:59:30,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 00:59:30,676 INFO L276 IsEmpty]: Start isEmpty. Operand 16618 states and 17471 transitions. [2022-07-12 00:59:30,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2022-07-12 00:59:30,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:30,686 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:59:30,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 00:59:30,687 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:30,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:30,687 INFO L85 PathProgramCache]: Analyzing trace with hash -673100433, now seen corresponding path program 1 times [2022-07-12 00:59:30,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:30,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143201350] [2022-07-12 00:59:30,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:30,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2022-07-12 00:59:30,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:30,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143201350] [2022-07-12 00:59:30,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143201350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:30,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:30,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:59:30,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056065870] [2022-07-12 00:59:30,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:30,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:59:30,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:30,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:59:30,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:30,824 INFO L87 Difference]: Start difference. First operand 16618 states and 17471 transitions. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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 00:59:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:31,307 INFO L93 Difference]: Finished difference Result 34354 states and 36150 transitions. [2022-07-12 00:59:31,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:59:31,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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) Word has length 613 [2022-07-12 00:59:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:31,327 INFO L225 Difference]: With dead ends: 34354 [2022-07-12 00:59:31,328 INFO L226 Difference]: Without dead ends: 19580 [2022-07-12 00:59:31,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:31,340 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 61 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:31,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 117 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 00:59:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19580 states. [2022-07-12 00:59:31,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19580 to 17170. [2022-07-12 00:59:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17170 states, 17169 states have (on average 1.0509639466480285) internal successors, (18044), 17169 states have internal predecessors, (18044), 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 00:59:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17170 states to 17170 states and 18044 transitions. [2022-07-12 00:59:31,533 INFO L78 Accepts]: Start accepts. Automaton has 17170 states and 18044 transitions. Word has length 613 [2022-07-12 00:59:31,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:31,533 INFO L495 AbstractCegarLoop]: Abstraction has 17170 states and 18044 transitions. [2022-07-12 00:59:31,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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 00:59:31,534 INFO L276 IsEmpty]: Start isEmpty. Operand 17170 states and 18044 transitions. [2022-07-12 00:59:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2022-07-12 00:59:31,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:31,602 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 00:59:31,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 00:59:31,603 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:31,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:31,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1558333360, now seen corresponding path program 1 times [2022-07-12 00:59:31,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:31,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326398222] [2022-07-12 00:59:31,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:31,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 946 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-07-12 00:59:31,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:31,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326398222] [2022-07-12 00:59:31,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326398222] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:31,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:31,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:59:31,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605962801] [2022-07-12 00:59:31,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:31,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 00:59:31,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:31,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 00:59:31,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:59:31,745 INFO L87 Difference]: Start difference. First operand 17170 states and 18044 transitions. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 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 00:59:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:32,508 INFO L93 Difference]: Finished difference Result 34530 states and 36320 transitions. [2022-07-12 00:59:32,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 00:59:32,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 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) Word has length 614 [2022-07-12 00:59:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:32,528 INFO L225 Difference]: With dead ends: 34530 [2022-07-12 00:59:32,528 INFO L226 Difference]: Without dead ends: 19020 [2022-07-12 00:59:32,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:59:32,540 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 181 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:32,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 72 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 00:59:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19020 states. [2022-07-12 00:59:32,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19020 to 16250. [2022-07-12 00:59:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16250 states, 16249 states have (on average 1.0507723552218597) internal successors, (17074), 16249 states have internal predecessors, (17074), 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 00:59:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16250 states to 16250 states and 17074 transitions. [2022-07-12 00:59:32,705 INFO L78 Accepts]: Start accepts. Automaton has 16250 states and 17074 transitions. Word has length 614 [2022-07-12 00:59:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:32,706 INFO L495 AbstractCegarLoop]: Abstraction has 16250 states and 17074 transitions. [2022-07-12 00:59:32,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 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 00:59:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 16250 states and 17074 transitions. [2022-07-12 00:59:32,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2022-07-12 00:59:32,716 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:32,716 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:59:32,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 00:59:32,717 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:32,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:32,718 INFO L85 PathProgramCache]: Analyzing trace with hash 425200427, now seen corresponding path program 1 times [2022-07-12 00:59:32,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:32,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469894773] [2022-07-12 00:59:32,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:32,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 1140 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2022-07-12 00:59:32,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:32,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469894773] [2022-07-12 00:59:32,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469894773] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:32,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:32,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 00:59:32,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757792778] [2022-07-12 00:59:32,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:32,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 00:59:33,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:33,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 00:59:33,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:59:33,001 INFO L87 Difference]: Start difference. First operand 16250 states and 17074 transitions. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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 00:59:33,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:33,868 INFO L93 Difference]: Finished difference Result 33977 states and 35786 transitions. [2022-07-12 00:59:33,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 00:59:33,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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) Word has length 620 [2022-07-12 00:59:33,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:33,883 INFO L225 Difference]: With dead ends: 33977 [2022-07-12 00:59:33,883 INFO L226 Difference]: Without dead ends: 17915 [2022-07-12 00:59:33,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:59:33,892 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 186 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:33,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 73 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 00:59:33,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17915 states. [2022-07-12 00:59:34,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17915 to 17910. [2022-07-12 00:59:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17910 states, 17909 states have (on average 1.0518733597632475) internal successors, (18838), 17909 states have internal predecessors, (18838), 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 00:59:34,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17910 states to 17910 states and 18838 transitions. [2022-07-12 00:59:34,146 INFO L78 Accepts]: Start accepts. Automaton has 17910 states and 18838 transitions. Word has length 620 [2022-07-12 00:59:34,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:34,146 INFO L495 AbstractCegarLoop]: Abstraction has 17910 states and 18838 transitions. [2022-07-12 00:59:34,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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 00:59:34,147 INFO L276 IsEmpty]: Start isEmpty. Operand 17910 states and 18838 transitions. [2022-07-12 00:59:34,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2022-07-12 00:59:34,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:59:34,157 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:59:34,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 00:59:34,157 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:59:34,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:59:34,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2023009957, now seen corresponding path program 1 times [2022-07-12 00:59:34,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:59:34,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022323352] [2022-07-12 00:59:34,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:59:34,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:59:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:59:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2022-07-12 00:59:34,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:59:34,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022323352] [2022-07-12 00:59:34,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022323352] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:59:34,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:59:34,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:59:34,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997346786] [2022-07-12 00:59:34,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:59:34,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:59:34,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:59:34,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:59:34,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:34,304 INFO L87 Difference]: Start difference. First operand 17910 states and 18838 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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 00:59:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:59:34,713 INFO L93 Difference]: Finished difference Result 18097 states and 19036 transitions. [2022-07-12 00:59:34,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:59:34,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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) Word has length 627 [2022-07-12 00:59:34,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:59:34,714 INFO L225 Difference]: With dead ends: 18097 [2022-07-12 00:59:34,714 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 00:59:34,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:59:34,720 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 143 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 00:59:34,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 322 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 00:59:34,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 00:59:34,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 00:59:34,735 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 00:59:34,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 00:59:34,735 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 627 [2022-07-12 00:59:34,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:59:34,736 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 00:59:34,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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 00:59:34,736 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 00:59:34,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 00:59:34,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 00:59:34,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 00:59:34,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 00:59:52,537 INFO L899 garLoopResultBuilder]: For program point L498(lines 498 509) no Hoare annotation was computed. [2022-07-12 00:59:52,538 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,538 INFO L899 garLoopResultBuilder]: For program point L498-2(lines 498 509) no Hoare annotation was computed. [2022-07-12 00:59:52,538 INFO L899 garLoopResultBuilder]: For program point L168-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,538 INFO L899 garLoopResultBuilder]: For program point L102-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,538 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,538 INFO L899 garLoopResultBuilder]: For program point L1027(lines 1027 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,538 INFO L899 garLoopResultBuilder]: For program point L631(lines 631 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,539 INFO L899 garLoopResultBuilder]: For program point L565(lines 565 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,540 INFO L899 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2022-07-12 00:59:52,540 INFO L899 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2022-07-12 00:59:52,540 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-07-12 00:59:52,540 INFO L899 garLoopResultBuilder]: For program point L896(lines 896 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,540 INFO L899 garLoopResultBuilder]: For program point L698(lines 698 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,540 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,540 INFO L899 garLoopResultBuilder]: For program point L963(lines 963 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,541 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,541 INFO L899 garLoopResultBuilder]: For program point L171-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,541 INFO L899 garLoopResultBuilder]: For program point L105-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,541 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,541 INFO L899 garLoopResultBuilder]: For program point L832(lines 832 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,541 INFO L899 garLoopResultBuilder]: For program point L304(lines 304 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,541 INFO L899 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2022-07-12 00:59:52,541 INFO L899 garLoopResultBuilder]: For program point L106(line 106) no Hoare annotation was computed. [2022-07-12 00:59:52,542 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2022-07-12 00:59:52,542 INFO L899 garLoopResultBuilder]: For program point L767(lines 767 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,542 INFO L899 garLoopResultBuilder]: For program point L768(lines 768 778) no Hoare annotation was computed. [2022-07-12 00:59:52,542 INFO L899 garLoopResultBuilder]: For program point L768-2(lines 768 778) no Hoare annotation was computed. [2022-07-12 00:59:52,542 INFO L899 garLoopResultBuilder]: For program point L174-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,542 INFO L899 garLoopResultBuilder]: For program point L108-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,542 INFO L899 garLoopResultBuilder]: For program point L42-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,542 INFO L899 garLoopResultBuilder]: For program point L835(lines 835 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,542 INFO L899 garLoopResultBuilder]: For program point L571(lines 571 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,542 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,542 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2022-07-12 00:59:52,543 INFO L899 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2022-07-12 00:59:52,543 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-07-12 00:59:52,543 INFO L899 garLoopResultBuilder]: For program point L968(lines 968 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,543 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,543 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,543 INFO L895 garLoopResultBuilder]: At program point L1035(lines 32 1036) the Hoare annotation is: (let ((.cse26 (+ ~a23~0 43))) (let ((.cse6 (<= .cse26 0)) (.cse17 (< 306 ~a23~0)) (.cse7 (= ~a25~0 12))) (let ((.cse15 (<= 99915 ~a29~0)) (.cse14 (or (not .cse17) (not .cse7) (not (< 277 ~a29~0)))) (.cse16 (<= ~a23~0 306)) (.cse20 (<= ~a29~0 245)) (.cse10 (<= ~a29~0 274)) (.cse12 (<= 261 ~a29~0)) (.cse11 (<= 130 ~a29~0)) (.cse13 (<= ~a29~0 599998)) (.cse5 (<= ~a23~0 138)) (.cse19 (= ~a25~0 11)) (.cse21 (<= (+ 119992 ~a23~0) 0)) (.cse1 (<= ~a23~0 278)) (.cse18 (= ~a25~0 10)) (.cse0 (= ~a25~0 13)) (.cse2 (< 0 .cse26)) (.cse23 (<= ~a29~0 232)) (.cse22 (<= (+ ~a29~0 554036) 0)) (.cse8 (= ~a4~0 0)) (.cse4 (<= ~a25~0 10)) (.cse25 (or (not .cse6) (not (= ~a25~0 9)) (not (<= ~a29~0 140)))) (.cse24 (<= ~a29~0 220)) (.cse9 (<= (+ ~a29~0 22) 0)) (.cse3 (= ~a4~0 1))) (or (and .cse0 .cse1 (<= 99912 ~a29~0) .cse2 .cse3) (and .cse4 .cse5 .cse3) (and .cse6 .cse7 .cse8 .cse9) (and .cse7 .cse2 .cse10 .cse3 .cse11) (and .cse6 .cse12 .cse8 .cse4 .cse13) (and .cse2 .cse3 .cse14 .cse15 (or (not .cse0) .cse16)) (and (or (and .cse8 .cse4 .cse15) (and .cse7 .cse12 .cse8)) .cse13 .cse14) (and .cse7 .cse12 .cse17 .cse3 .cse14) (and .cse3 .cse18) (and .cse0 .cse13 .cse3 (not .cse16)) (and .cse19 .cse2 .cse3 (<= ~a23~0 312)) (and .cse6 .cse20 .cse3 .cse11) (and .cse0 .cse20 .cse3 .cse11) (and .cse7 .cse8 .cse10 .cse11) (and .cse0 .cse6 .cse8 .cse10 .cse11) (and .cse12 .cse8 .cse19 .cse13 .cse21) (and .cse19 .cse3 .cse11) (and .cse7 .cse8 .cse22) (and .cse4 .cse3 .cse11) (and .cse7 .cse5 .cse3 .cse23) (and .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse2 .cse13 .cse5) (and .cse6 .cse8 .cse19 .cse9 .cse24) (and .cse8 .cse19 .cse24 .cse21) (and .cse1 .cse9 .cse2 .cse3 .cse23) (and .cse8 .cse9 .cse4 .cse25 .cse24 (<= 0 (+ ~a29~0 28553)) .cse18) (and .cse0 .cse2 .cse3 .cse23) (and .cse6 .cse8 .cse4 .cse22) (and .cse8 .cse9 .cse4 .cse25 .cse24 (<= (+ ~a23~0 599772) 0)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse7 .cse9 (= ~a3~0 1) .cse3 (<= 312 ~a23~0) (= ~a8~0 15)))))) [2022-07-12 00:59:52,543 INFO L899 garLoopResultBuilder]: For program point L903(lines 903 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,544 INFO L899 garLoopResultBuilder]: For program point L705(lines 705 715) no Hoare annotation was computed. [2022-07-12 00:59:52,544 INFO L899 garLoopResultBuilder]: For program point L705-2(lines 705 715) no Hoare annotation was computed. [2022-07-12 00:59:52,544 INFO L899 garLoopResultBuilder]: For program point L375(lines 375 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,544 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,544 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,544 INFO L899 garLoopResultBuilder]: For program point L177-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,546 INFO L899 garLoopResultBuilder]: For program point L111-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,547 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,547 INFO L899 garLoopResultBuilder]: For program point L178(line 178) no Hoare annotation was computed. [2022-07-12 00:59:52,547 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2022-07-12 00:59:52,547 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-07-12 00:59:52,547 INFO L902 garLoopResultBuilder]: At program point L1038(lines 1038 1054) the Hoare annotation is: true [2022-07-12 00:59:52,548 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,548 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,548 INFO L899 garLoopResultBuilder]: For program point L180-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,548 INFO L899 garLoopResultBuilder]: For program point L114-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,548 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,548 INFO L899 garLoopResultBuilder]: For program point L973(lines 973 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,549 INFO L899 garLoopResultBuilder]: For program point L841(lines 841 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,549 INFO L899 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2022-07-12 00:59:52,549 INFO L899 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2022-07-12 00:59:52,549 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-07-12 00:59:52,549 INFO L899 garLoopResultBuilder]: For program point L908(lines 908 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,549 INFO L899 garLoopResultBuilder]: For program point L446(lines 446 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,549 INFO L899 garLoopResultBuilder]: For program point L380(lines 380 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,549 INFO L899 garLoopResultBuilder]: For program point L645(lines 645 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,549 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,549 INFO L899 garLoopResultBuilder]: For program point L183-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,549 INFO L899 garLoopResultBuilder]: For program point L117-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,550 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,550 INFO L899 garLoopResultBuilder]: For program point L250(lines 250 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,550 INFO L899 garLoopResultBuilder]: For program point L184(line 184) no Hoare annotation was computed. [2022-07-12 00:59:52,550 INFO L899 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2022-07-12 00:59:52,550 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2022-07-12 00:59:52,550 INFO L899 garLoopResultBuilder]: For program point L779(lines 779 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,551 INFO L895 garLoopResultBuilder]: At program point L1044-2(lines 1044 1053) the Hoare annotation is: (let ((.cse26 (+ ~a23~0 43))) (let ((.cse6 (<= .cse26 0)) (.cse17 (< 306 ~a23~0)) (.cse7 (= ~a25~0 12))) (let ((.cse15 (<= 99915 ~a29~0)) (.cse14 (or (not .cse17) (not .cse7) (not (< 277 ~a29~0)))) (.cse16 (<= ~a23~0 306)) (.cse20 (<= ~a29~0 245)) (.cse10 (<= ~a29~0 274)) (.cse12 (<= 261 ~a29~0)) (.cse11 (<= 130 ~a29~0)) (.cse13 (<= ~a29~0 599998)) (.cse5 (<= ~a23~0 138)) (.cse19 (= ~a25~0 11)) (.cse21 (<= (+ 119992 ~a23~0) 0)) (.cse1 (<= ~a23~0 278)) (.cse18 (= ~a25~0 10)) (.cse0 (= ~a25~0 13)) (.cse2 (< 0 .cse26)) (.cse23 (<= ~a29~0 232)) (.cse22 (<= (+ ~a29~0 554036) 0)) (.cse8 (= ~a4~0 0)) (.cse4 (<= ~a25~0 10)) (.cse25 (or (not .cse6) (not (= ~a25~0 9)) (not (<= ~a29~0 140)))) (.cse24 (<= ~a29~0 220)) (.cse9 (<= (+ ~a29~0 22) 0)) (.cse3 (= ~a4~0 1))) (or (and .cse0 .cse1 (<= 99912 ~a29~0) .cse2 .cse3) (and .cse4 .cse5 .cse3) (and .cse6 .cse7 .cse8 .cse9) (and .cse7 .cse2 .cse10 .cse3 .cse11) (and .cse6 .cse12 .cse8 .cse4 .cse13) (and .cse2 .cse3 .cse14 .cse15 (or (not .cse0) .cse16)) (and (or (and .cse8 .cse4 .cse15) (and .cse7 .cse12 .cse8)) .cse13 .cse14) (and .cse7 .cse12 .cse17 .cse3 .cse14) (and .cse3 .cse18) (and .cse0 .cse13 .cse3 (not .cse16)) (and .cse19 .cse2 .cse3 (<= ~a23~0 312)) (and .cse6 .cse20 .cse3 .cse11) (and .cse0 .cse20 .cse3 .cse11) (and .cse7 .cse8 .cse10 .cse11) (and .cse0 .cse6 .cse8 .cse10 .cse11) (and .cse12 .cse8 .cse19 .cse13 .cse21) (and .cse19 .cse3 .cse11) (and .cse7 .cse8 .cse22) (and .cse4 .cse3 .cse11) (and .cse7 .cse5 .cse3 .cse23) (and .cse1 .cse7 .cse2 .cse3) (and .cse8 .cse2 .cse13 .cse5) (and .cse6 .cse8 .cse19 .cse9 .cse24) (and .cse8 .cse19 .cse24 .cse21) (and .cse1 .cse9 .cse2 .cse3 .cse23) (and .cse8 .cse9 .cse4 .cse25 .cse24 (<= 0 (+ ~a29~0 28553)) .cse18) (and .cse0 .cse2 .cse3 .cse23) (and .cse6 .cse8 .cse4 .cse22) (and .cse8 .cse9 .cse4 .cse25 .cse24 (<= (+ ~a23~0 599772) 0)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse7 .cse9 (= ~a3~0 1) .cse3 (<= 312 ~a23~0) (= ~a8~0 15)))))) [2022-07-12 00:59:52,551 INFO L899 garLoopResultBuilder]: For program point L846(lines 846 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,551 INFO L899 garLoopResultBuilder]: For program point L582(lines 582 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,551 INFO L899 garLoopResultBuilder]: For program point L186-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,551 INFO L899 garLoopResultBuilder]: For program point L120-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,551 INFO L899 garLoopResultBuilder]: For program point L54-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,551 INFO L899 garLoopResultBuilder]: For program point L979(lines 979 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,551 INFO L899 garLoopResultBuilder]: For program point L913(lines 913 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,551 INFO L899 garLoopResultBuilder]: For program point L517(lines 517 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,551 INFO L899 garLoopResultBuilder]: For program point L187(line 187) no Hoare annotation was computed. [2022-07-12 00:59:52,552 INFO L899 garLoopResultBuilder]: For program point L121(line 121) no Hoare annotation was computed. [2022-07-12 00:59:52,552 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-07-12 00:59:52,552 INFO L899 garLoopResultBuilder]: For program point L980(lines 980 990) no Hoare annotation was computed. [2022-07-12 00:59:52,552 INFO L899 garLoopResultBuilder]: For program point L914(lines 914 924) no Hoare annotation was computed. [2022-07-12 00:59:52,552 INFO L899 garLoopResultBuilder]: For program point L980-2(lines 980 990) no Hoare annotation was computed. [2022-07-12 00:59:52,552 INFO L899 garLoopResultBuilder]: For program point L914-2(lines 914 924) no Hoare annotation was computed. [2022-07-12 00:59:52,552 INFO L899 garLoopResultBuilder]: For program point L716(lines 716 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,552 INFO L899 garLoopResultBuilder]: For program point L320(lines 320 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,552 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,552 INFO L899 garLoopResultBuilder]: For program point L453(lines 453 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,552 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,553 INFO L899 garLoopResultBuilder]: For program point L189-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,553 INFO L899 garLoopResultBuilder]: For program point L123-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,553 INFO L899 garLoopResultBuilder]: For program point L57-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,553 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,553 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,553 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 00:59:52,553 INFO L899 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2022-07-12 00:59:52,553 INFO L899 garLoopResultBuilder]: For program point L124(line 124) no Hoare annotation was computed. [2022-07-12 00:59:52,553 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2022-07-12 00:59:52,553 INFO L899 garLoopResultBuilder]: For program point L1049(line 1049) no Hoare annotation was computed. [2022-07-12 00:59:52,553 INFO L899 garLoopResultBuilder]: For program point L851(lines 851 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,554 INFO L899 garLoopResultBuilder]: For program point L257(lines 257 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,554 INFO L899 garLoopResultBuilder]: For program point L192-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,554 INFO L899 garLoopResultBuilder]: For program point L126-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,554 INFO L899 garLoopResultBuilder]: For program point L60-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,554 INFO L899 garLoopResultBuilder]: For program point L193(line 193) no Hoare annotation was computed. [2022-07-12 00:59:52,554 INFO L899 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2022-07-12 00:59:52,554 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-07-12 00:59:52,554 INFO L899 garLoopResultBuilder]: For program point L722(lines 722 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,554 INFO L899 garLoopResultBuilder]: For program point L524(lines 524 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,555 INFO L899 garLoopResultBuilder]: For program point L657(lines 657 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,555 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,555 INFO L899 garLoopResultBuilder]: For program point L525(lines 525 535) no Hoare annotation was computed. [2022-07-12 00:59:52,555 INFO L899 garLoopResultBuilder]: For program point L525-2(lines 525 535) no Hoare annotation was computed. [2022-07-12 00:59:52,555 INFO L899 garLoopResultBuilder]: For program point L327(lines 327 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,555 INFO L899 garLoopResultBuilder]: For program point L195-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,555 INFO L899 garLoopResultBuilder]: For program point L129-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,555 INFO L899 garLoopResultBuilder]: For program point L63-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,555 INFO L899 garLoopResultBuilder]: For program point L856(lines 856 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,555 INFO L899 garLoopResultBuilder]: For program point L790(lines 790 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,555 INFO L899 garLoopResultBuilder]: For program point L658(lines 658 667) no Hoare annotation was computed. [2022-07-12 00:59:52,556 INFO L899 garLoopResultBuilder]: For program point L658-2(lines 658 667) no Hoare annotation was computed. [2022-07-12 00:59:52,556 INFO L899 garLoopResultBuilder]: For program point L460(lines 460 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,556 INFO L899 garLoopResultBuilder]: For program point L394(lines 394 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,556 INFO L899 garLoopResultBuilder]: For program point L196(line 196) no Hoare annotation was computed. [2022-07-12 00:59:52,556 INFO L899 garLoopResultBuilder]: For program point L130(line 130) no Hoare annotation was computed. [2022-07-12 00:59:52,556 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2022-07-12 00:59:52,556 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 00:59:52,556 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-07-12 00:59:52,556 INFO L899 garLoopResultBuilder]: For program point L264(lines 264 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,556 INFO L899 garLoopResultBuilder]: For program point L198-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,557 INFO L899 garLoopResultBuilder]: For program point L132-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,557 INFO L899 garLoopResultBuilder]: For program point L66-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,557 INFO L899 garLoopResultBuilder]: For program point L991(lines 991 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,557 INFO L899 garLoopResultBuilder]: For program point L925(lines 925 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,557 INFO L899 garLoopResultBuilder]: For program point L727(lines 727 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,557 INFO L899 garLoopResultBuilder]: For program point L199(line 199) no Hoare annotation was computed. [2022-07-12 00:59:52,557 INFO L899 garLoopResultBuilder]: For program point L133(line 133) no Hoare annotation was computed. [2022-07-12 00:59:52,557 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2022-07-12 00:59:52,557 INFO L899 garLoopResultBuilder]: For program point L926(lines 926 936) no Hoare annotation was computed. [2022-07-12 00:59:52,557 INFO L899 garLoopResultBuilder]: For program point L926-2(lines 926 936) no Hoare annotation was computed. [2022-07-12 00:59:52,557 INFO L899 garLoopResultBuilder]: For program point L728(lines 728 740) no Hoare annotation was computed. [2022-07-12 00:59:52,558 INFO L899 garLoopResultBuilder]: For program point L728-2(lines 728 740) no Hoare annotation was computed. [2022-07-12 00:59:52,558 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,558 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,558 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 607) no Hoare annotation was computed. [2022-07-12 00:59:52,558 INFO L899 garLoopResultBuilder]: For program point L597-2(lines 597 607) no Hoare annotation was computed. [2022-07-12 00:59:52,559 INFO L899 garLoopResultBuilder]: For program point L201-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,559 INFO L899 garLoopResultBuilder]: For program point L135-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,559 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,559 INFO L899 garLoopResultBuilder]: For program point L862(lines 862 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,559 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,559 INFO L899 garLoopResultBuilder]: For program point L202(line 202) no Hoare annotation was computed. [2022-07-12 00:59:52,559 INFO L899 garLoopResultBuilder]: For program point L136(line 136) no Hoare annotation was computed. [2022-07-12 00:59:52,559 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2022-07-12 00:59:52,559 INFO L899 garLoopResultBuilder]: For program point L797(lines 797 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,559 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,559 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,560 INFO L899 garLoopResultBuilder]: For program point L204-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,560 INFO L899 garLoopResultBuilder]: For program point L138-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,560 INFO L899 garLoopResultBuilder]: For program point L72-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,560 INFO L899 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2022-07-12 00:59:52,560 INFO L899 garLoopResultBuilder]: For program point L139(line 139) no Hoare annotation was computed. [2022-07-12 00:59:52,560 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2022-07-12 00:59:52,561 INFO L899 garLoopResultBuilder]: For program point L998(lines 998 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,561 INFO L899 garLoopResultBuilder]: For program point L668(lines 668 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,561 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,561 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,561 INFO L899 garLoopResultBuilder]: For program point L207-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,561 INFO L899 garLoopResultBuilder]: For program point L141-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,561 INFO L899 garLoopResultBuilder]: For program point L75-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,561 INFO L899 garLoopResultBuilder]: For program point L802(lines 802 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,561 INFO L899 garLoopResultBuilder]: For program point L208(line 208) no Hoare annotation was computed. [2022-07-12 00:59:52,561 INFO L899 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2022-07-12 00:59:52,561 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-07-12 00:59:52,562 INFO L899 garLoopResultBuilder]: For program point L869(lines 869 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,562 INFO L899 garLoopResultBuilder]: For program point L473(lines 473 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,562 INFO L899 garLoopResultBuilder]: For program point L275(lines 275 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,562 INFO L899 garLoopResultBuilder]: For program point L408(lines 408 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,562 INFO L899 garLoopResultBuilder]: For program point L210-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,562 INFO L899 garLoopResultBuilder]: For program point L144-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,562 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,562 INFO L899 garLoopResultBuilder]: For program point L1003(lines 1003 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,562 INFO L899 garLoopResultBuilder]: For program point L937(lines 937 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,562 INFO L899 garLoopResultBuilder]: For program point L673(lines 673 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,562 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,563 INFO L899 garLoopResultBuilder]: For program point L409(lines 409 420) no Hoare annotation was computed. [2022-07-12 00:59:52,563 INFO L899 garLoopResultBuilder]: For program point L409-2(lines 409 420) no Hoare annotation was computed. [2022-07-12 00:59:52,563 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-12 00:59:52,563 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-07-12 00:59:52,563 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2022-07-12 00:59:52,563 INFO L899 garLoopResultBuilder]: For program point L608(lines 608 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,563 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,563 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,563 INFO L899 garLoopResultBuilder]: For program point L741(lines 741 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,563 INFO L899 garLoopResultBuilder]: For program point L213-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,564 INFO L899 garLoopResultBuilder]: For program point L147-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,564 INFO L899 garLoopResultBuilder]: For program point L81-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,564 INFO L899 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-07-12 00:59:52,564 INFO L899 garLoopResultBuilder]: For program point L148(line 148) no Hoare annotation was computed. [2022-07-12 00:59:52,564 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2022-07-12 00:59:52,564 INFO L899 garLoopResultBuilder]: For program point L875(lines 875 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,564 INFO L899 garLoopResultBuilder]: For program point L809(lines 809 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,564 INFO L899 garLoopResultBuilder]: For program point L942(lines 942 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,564 INFO L899 garLoopResultBuilder]: For program point L876(lines 876 885) no Hoare annotation was computed. [2022-07-12 00:59:52,564 INFO L899 garLoopResultBuilder]: For program point L876-2(lines 876 885) no Hoare annotation was computed. [2022-07-12 00:59:52,564 INFO L899 garLoopResultBuilder]: For program point L480(lines 480 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,565 INFO L899 garLoopResultBuilder]: For program point L150-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,565 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,565 INFO L899 garLoopResultBuilder]: For program point L613(lines 613 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,565 INFO L899 garLoopResultBuilder]: For program point L547(lines 547 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,565 INFO L899 garLoopResultBuilder]: For program point L151(line 151) no Hoare annotation was computed. [2022-07-12 00:59:52,565 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-07-12 00:59:52,565 INFO L899 garLoopResultBuilder]: For program point L1010(lines 1010 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,565 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,565 INFO L899 garLoopResultBuilder]: For program point L614(lines 614 624) no Hoare annotation was computed. [2022-07-12 00:59:52,565 INFO L899 garLoopResultBuilder]: For program point L614-2(lines 614 624) no Hoare annotation was computed. [2022-07-12 00:59:52,565 INFO L899 garLoopResultBuilder]: For program point L350(lines 350 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,566 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 00:59:52,566 INFO L899 garLoopResultBuilder]: For program point L285(lines 285 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,566 INFO L899 garLoopResultBuilder]: For program point L153-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,566 INFO L899 garLoopResultBuilder]: For program point L87-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,566 INFO L899 garLoopResultBuilder]: For program point L814(lines 814 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,566 INFO L899 garLoopResultBuilder]: For program point L748(lines 748 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,566 INFO L899 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2022-07-12 00:59:52,566 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2022-07-12 00:59:52,566 INFO L899 garLoopResultBuilder]: For program point L815(lines 815 825) no Hoare annotation was computed. [2022-07-12 00:59:52,566 INFO L899 garLoopResultBuilder]: For program point L815-2(lines 815 825) no Hoare annotation was computed. [2022-07-12 00:59:52,566 INFO L899 garLoopResultBuilder]: For program point L552(lines 552 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,567 INFO L899 garLoopResultBuilder]: For program point L156-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,567 INFO L899 garLoopResultBuilder]: For program point L90-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,567 INFO L899 garLoopResultBuilder]: For program point L1015(lines 1015 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,567 INFO L899 garLoopResultBuilder]: For program point L949(lines 949 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,567 INFO L899 garLoopResultBuilder]: For program point L685(lines 685 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,571 INFO L899 garLoopResultBuilder]: For program point L487(lines 487 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,580 INFO L899 garLoopResultBuilder]: For program point L421(lines 421 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,580 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-07-12 00:59:52,580 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2022-07-12 00:59:52,581 INFO L899 garLoopResultBuilder]: For program point L950(lines 950 962) no Hoare annotation was computed. [2022-07-12 00:59:52,581 INFO L899 garLoopResultBuilder]: For program point L950-2(lines 950 962) no Hoare annotation was computed. [2022-07-12 00:59:52,581 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 496) no Hoare annotation was computed. [2022-07-12 00:59:52,581 INFO L899 garLoopResultBuilder]: For program point L488-2(lines 488 496) no Hoare annotation was computed. [2022-07-12 00:59:52,581 INFO L899 garLoopResultBuilder]: For program point L356(lines 356 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,582 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,582 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,582 INFO L899 garLoopResultBuilder]: For program point L753(lines 753 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,582 INFO L899 garLoopResultBuilder]: For program point L159-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,583 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,583 INFO L899 garLoopResultBuilder]: For program point L886(lines 886 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,584 INFO L899 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2022-07-12 00:59:52,584 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2022-07-12 00:59:52,584 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 00:59:52,584 INFO L899 garLoopResultBuilder]: For program point L162-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,584 INFO L899 garLoopResultBuilder]: For program point L96-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,584 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,584 INFO L899 garLoopResultBuilder]: For program point L625(lines 625 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,584 INFO L899 garLoopResultBuilder]: For program point L559(lines 559 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,584 INFO L899 garLoopResultBuilder]: For program point L427(lines 427 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,584 INFO L899 garLoopResultBuilder]: For program point L163(line 163) no Hoare annotation was computed. [2022-07-12 00:59:52,584 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-07-12 00:59:52,585 INFO L899 garLoopResultBuilder]: For program point L1022(lines 1022 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,585 INFO L899 garLoopResultBuilder]: For program point L891(lines 891 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,585 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,585 INFO L899 garLoopResultBuilder]: For program point L297(lines 297 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,585 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,585 INFO L899 garLoopResultBuilder]: For program point L165-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,585 INFO L899 garLoopResultBuilder]: For program point L99-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,585 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 35) no Hoare annotation was computed. [2022-07-12 00:59:52,585 INFO L899 garLoopResultBuilder]: For program point L33-2(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:59:52,586 INFO L899 garLoopResultBuilder]: For program point L826(lines 826 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,586 INFO L899 garLoopResultBuilder]: For program point L760(lines 760 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,586 INFO L899 garLoopResultBuilder]: For program point L166(line 166) no Hoare annotation was computed. [2022-07-12 00:59:52,586 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2022-07-12 00:59:52,586 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-07-12 00:59:52,586 INFO L899 garLoopResultBuilder]: For program point L497(lines 497 1034) no Hoare annotation was computed. [2022-07-12 00:59:52,588 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:59:52,590 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 00:59:52,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 12:59:52 BoogieIcfgContainer [2022-07-12 00:59:52,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 00:59:52,664 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 00:59:52,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 00:59:52,664 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 00:59:52,664 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:58:58" (3/4) ... [2022-07-12 00:59:52,666 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 00:59:52,717 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-12 00:59:52,718 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-12 00:59:52,719 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 00:59:52,720 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 00:59:52,820 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 00:59:52,820 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 00:59:52,820 INFO L158 Benchmark]: Toolchain (without parser) took 55954.28ms. Allocated memory was 94.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 60.4MB in the beginning and 720.1MB in the end (delta: -659.7MB). Peak memory consumption was 882.9MB. Max. memory is 16.1GB. [2022-07-12 00:59:52,820 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 94.4MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 00:59:52,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.60ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 60.2MB in the beginning and 87.7MB in the end (delta: -27.5MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2022-07-12 00:59:52,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.64ms. Allocated memory is still 121.6MB. Free memory was 87.7MB in the beginning and 70.9MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-12 00:59:52,821 INFO L158 Benchmark]: Boogie Preprocessor took 84.19ms. Allocated memory is still 121.6MB. Free memory was 70.3MB in the beginning and 61.3MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 00:59:52,823 INFO L158 Benchmark]: RCFGBuilder took 1173.65ms. Allocated memory was 121.6MB in the beginning and 195.0MB in the end (delta: 73.4MB). Free memory was 61.3MB in the beginning and 123.1MB in the end (delta: -61.8MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2022-07-12 00:59:52,823 INFO L158 Benchmark]: TraceAbstraction took 53913.00ms. Allocated memory was 195.0MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 123.1MB in the beginning and 735.6MB in the end (delta: -612.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-07-12 00:59:52,823 INFO L158 Benchmark]: Witness Printer took 155.95ms. Allocated memory is still 1.6GB. Free memory was 735.6MB in the beginning and 720.1MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 00:59:52,829 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 94.4MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.60ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 60.2MB in the beginning and 87.7MB in the end (delta: -27.5MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.64ms. Allocated memory is still 121.6MB. Free memory was 87.7MB in the beginning and 70.9MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.19ms. Allocated memory is still 121.6MB. Free memory was 70.3MB in the beginning and 61.3MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1173.65ms. Allocated memory was 121.6MB in the beginning and 195.0MB in the end (delta: 73.4MB). Free memory was 61.3MB in the beginning and 123.1MB in the end (delta: -61.8MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * TraceAbstraction took 53913.00ms. Allocated memory was 195.0MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 123.1MB in the beginning and 735.6MB in the end (delta: -612.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 155.95ms. Allocated memory is still 1.6GB. Free memory was 735.6MB in the beginning and 720.1MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.8s, OverallIterations: 28, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 23.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5883 SdHoareTripleChecker+Valid, 20.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5883 mSDsluCounter, 5645 SdHoareTripleChecker+Invalid, 16.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 888 mSDsCounter, 3446 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24179 IncrementalHoareTripleChecker+Invalid, 27625 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3446 mSolverCounterUnsat, 4757 mSDtfsCounter, 24179 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1898 GetRequests, 1810 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17910occurred in iteration=27, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 23204 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 277 NumberOfFragments, 1105 HoareAnnotationTreeSize, 3 FomulaSimplifications, 30760 FormulaSimplificationTreeSizeReduction, 8.8s HoareSimplificationTime, 3 FomulaSimplificationsInter, 172182 FormulaSimplificationTreeSizeReductionInter, 9.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 12128 NumberOfCodeBlocks, 12128 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 12523 ConstructedInterpolants, 0 QuantifiedInterpolants, 47260 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1849 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 32 InterpolantComputations, 27 PerfectInterpolantSequences, 16196/16686 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((a25 == 13 && a23 <= 278) && 99912 <= a29) && 0 < a23 + 43) && a4 == 1) || ((a25 <= 10 && a23 <= 138) && a4 == 1)) || (((a23 + 43 <= 0 && a25 == 12) && a4 == 0) && a29 + 22 <= 0)) || ((((a25 == 12 && 0 < a23 + 43) && a29 <= 274) && a4 == 1) && 130 <= a29)) || ((((a23 + 43 <= 0 && 261 <= a29) && a4 == 0) && a25 <= 10) && a29 <= 599998)) || ((((0 < a23 + 43 && a4 == 1) && ((!(306 < a23) || !(a25 == 12)) || !(277 < a29))) && 99915 <= a29) && (!(a25 == 13) || a23 <= 306))) || (((((a4 == 0 && a25 <= 10) && 99915 <= a29) || ((a25 == 12 && 261 <= a29) && a4 == 0)) && a29 <= 599998) && ((!(306 < a23) || !(a25 == 12)) || !(277 < a29)))) || ((((a25 == 12 && 261 <= a29) && 306 < a23) && a4 == 1) && ((!(306 < a23) || !(a25 == 12)) || !(277 < a29)))) || (a4 == 1 && a25 == 10)) || (((a25 == 13 && a29 <= 599998) && a4 == 1) && !(a23 <= 306))) || (((a25 == 11 && 0 < a23 + 43) && a4 == 1) && a23 <= 312)) || (((a23 + 43 <= 0 && a29 <= 245) && a4 == 1) && 130 <= a29)) || (((a25 == 13 && a29 <= 245) && a4 == 1) && 130 <= a29)) || (((a25 == 12 && a4 == 0) && a29 <= 274) && 130 <= a29)) || ((((a25 == 13 && a23 + 43 <= 0) && a4 == 0) && a29 <= 274) && 130 <= a29)) || ((((261 <= a29 && a4 == 0) && a25 == 11) && a29 <= 599998) && 119992 + a23 <= 0)) || ((a25 == 11 && a4 == 1) && 130 <= a29)) || ((a25 == 12 && a4 == 0) && a29 + 554036 <= 0)) || ((a25 <= 10 && a4 == 1) && 130 <= a29)) || (((a25 == 12 && a23 <= 138) && a4 == 1) && a29 <= 232)) || (((a23 <= 278 && a25 == 12) && 0 < a23 + 43) && a4 == 1)) || (((a4 == 0 && 0 < a23 + 43) && a29 <= 599998) && a23 <= 138)) || ((((a23 + 43 <= 0 && a4 == 0) && a25 == 11) && a29 + 22 <= 0) && a29 <= 220)) || (((a4 == 0 && a25 == 11) && a29 <= 220) && 119992 + a23 <= 0)) || ((((a23 <= 278 && a29 + 22 <= 0) && 0 < a23 + 43) && a4 == 1) && a29 <= 232)) || ((((((a4 == 0 && a29 + 22 <= 0) && a25 <= 10) && ((!(a23 + 43 <= 0) || !(a25 == 9)) || !(a29 <= 140))) && a29 <= 220) && 0 <= a29 + 28553) && a25 == 10)) || (((a25 == 13 && 0 < a23 + 43) && a4 == 1) && a29 <= 232)) || (((a23 + 43 <= 0 && a4 == 0) && a25 <= 10) && a29 + 554036 <= 0)) || (((((a4 == 0 && a29 + 22 <= 0) && a25 <= 10) && ((!(a23 + 43 <= 0) || !(a25 == 9)) || !(a29 <= 140))) && a29 <= 220) && a23 + 599772 <= 0)) || ((((((!(input == 1) && a25 == 12) && a29 + 22 <= 0) && a3 == 1) && a4 == 1) && 312 <= a23) && a8 == 15) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((a25 == 13 && a23 <= 278) && 99912 <= a29) && 0 < a23 + 43) && a4 == 1) || ((a25 <= 10 && a23 <= 138) && a4 == 1)) || (((a23 + 43 <= 0 && a25 == 12) && a4 == 0) && a29 + 22 <= 0)) || ((((a25 == 12 && 0 < a23 + 43) && a29 <= 274) && a4 == 1) && 130 <= a29)) || ((((a23 + 43 <= 0 && 261 <= a29) && a4 == 0) && a25 <= 10) && a29 <= 599998)) || ((((0 < a23 + 43 && a4 == 1) && ((!(306 < a23) || !(a25 == 12)) || !(277 < a29))) && 99915 <= a29) && (!(a25 == 13) || a23 <= 306))) || (((((a4 == 0 && a25 <= 10) && 99915 <= a29) || ((a25 == 12 && 261 <= a29) && a4 == 0)) && a29 <= 599998) && ((!(306 < a23) || !(a25 == 12)) || !(277 < a29)))) || ((((a25 == 12 && 261 <= a29) && 306 < a23) && a4 == 1) && ((!(306 < a23) || !(a25 == 12)) || !(277 < a29)))) || (a4 == 1 && a25 == 10)) || (((a25 == 13 && a29 <= 599998) && a4 == 1) && !(a23 <= 306))) || (((a25 == 11 && 0 < a23 + 43) && a4 == 1) && a23 <= 312)) || (((a23 + 43 <= 0 && a29 <= 245) && a4 == 1) && 130 <= a29)) || (((a25 == 13 && a29 <= 245) && a4 == 1) && 130 <= a29)) || (((a25 == 12 && a4 == 0) && a29 <= 274) && 130 <= a29)) || ((((a25 == 13 && a23 + 43 <= 0) && a4 == 0) && a29 <= 274) && 130 <= a29)) || ((((261 <= a29 && a4 == 0) && a25 == 11) && a29 <= 599998) && 119992 + a23 <= 0)) || ((a25 == 11 && a4 == 1) && 130 <= a29)) || ((a25 == 12 && a4 == 0) && a29 + 554036 <= 0)) || ((a25 <= 10 && a4 == 1) && 130 <= a29)) || (((a25 == 12 && a23 <= 138) && a4 == 1) && a29 <= 232)) || (((a23 <= 278 && a25 == 12) && 0 < a23 + 43) && a4 == 1)) || (((a4 == 0 && 0 < a23 + 43) && a29 <= 599998) && a23 <= 138)) || ((((a23 + 43 <= 0 && a4 == 0) && a25 == 11) && a29 + 22 <= 0) && a29 <= 220)) || (((a4 == 0 && a25 == 11) && a29 <= 220) && 119992 + a23 <= 0)) || ((((a23 <= 278 && a29 + 22 <= 0) && 0 < a23 + 43) && a4 == 1) && a29 <= 232)) || ((((((a4 == 0 && a29 + 22 <= 0) && a25 <= 10) && ((!(a23 + 43 <= 0) || !(a25 == 9)) || !(a29 <= 140))) && a29 <= 220) && 0 <= a29 + 28553) && a25 == 10)) || (((a25 == 13 && 0 < a23 + 43) && a4 == 1) && a29 <= 232)) || (((a23 + 43 <= 0 && a4 == 0) && a25 <= 10) && a29 + 554036 <= 0)) || (((((a4 == 0 && a29 + 22 <= 0) && a25 <= 10) && ((!(a23 + 43 <= 0) || !(a25 == 9)) || !(a29 <= 140))) && a29 <= 220) && a23 + 599772 <= 0)) || ((((((!(input == 1) && a25 == 12) && a29 + 22 <= 0) && a3 == 1) && a4 == 1) && 312 <= a23) && a8 == 15) - InvariantResult [Line: 1038]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-12 00:59:52,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE