./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label30.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/Problem03_label30.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 a272bf0f73a58d72dfba23a9c902bbeb665b6b76cc21acf92951a09cb8e04c47 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 00:02:06,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 00:02:06,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 00:02:06,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 00:02:06,415 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 00:02:06,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 00:02:06,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 00:02:06,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 00:02:06,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 00:02:06,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 00:02:06,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 00:02:06,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 00:02:06,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 00:02:06,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 00:02:06,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 00:02:06,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 00:02:06,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 00:02:06,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 00:02:06,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 00:02:06,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 00:02:06,443 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 00:02:06,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 00:02:06,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 00:02:06,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 00:02:06,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 00:02:06,476 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 00:02:06,476 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 00:02:06,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 00:02:06,477 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 00:02:06,478 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 00:02:06,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 00:02:06,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 00:02:06,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 00:02:06,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 00:02:06,480 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 00:02:06,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 00:02:06,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 00:02:06,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 00:02:06,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 00:02:06,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 00:02:06,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 00:02:06,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 00:02:06,494 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:02:06,536 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 00:02:06,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 00:02:06,537 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 00:02:06,537 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 00:02:06,538 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 00:02:06,538 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 00:02:06,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 00:02:06,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 00:02:06,539 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 00:02:06,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 00:02:06,551 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 00:02:06,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 00:02:06,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 00:02:06,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 00:02:06,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 00:02:06,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 00:02:06,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 00:02:06,552 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 00:02:06,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 00:02:06,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 00:02:06,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 00:02:06,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 00:02:06,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 00:02:06,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 00:02:06,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 00:02:06,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 00:02:06,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 00:02:06,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 00:02:06,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 00:02:06,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 00:02:06,555 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 00:02:06,555 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 00:02:06,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 00:02:06,555 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 -> a272bf0f73a58d72dfba23a9c902bbeb665b6b76cc21acf92951a09cb8e04c47 [2022-07-12 00:02:06,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 00:02:07,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 00:02:07,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 00:02:07,028 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 00:02:07,029 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 00:02:07,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label30.c [2022-07-12 00:02:07,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15c8cf5b/e830848b31aa4e5fad8b16f40890d8a8/FLAG129644e8a [2022-07-12 00:02:07,775 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 00:02:07,776 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label30.c [2022-07-12 00:02:07,811 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15c8cf5b/e830848b31aa4e5fad8b16f40890d8a8/FLAG129644e8a [2022-07-12 00:02:08,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15c8cf5b/e830848b31aa4e5fad8b16f40890d8a8 [2022-07-12 00:02:08,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 00:02:08,116 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 00:02:08,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 00:02:08,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 00:02:08,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 00:02:08,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:02:08" (1/1) ... [2022-07-12 00:02:08,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235d95dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:02:08, skipping insertion in model container [2022-07-12 00:02:08,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:02:08" (1/1) ... [2022-07-12 00:02:08,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 00:02:08,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 00:02:08,800 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/Problem03_label30.c[57849,57862] [2022-07-12 00:02:08,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 00:02:08,843 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 00:02:09,024 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/Problem03_label30.c[57849,57862] [2022-07-12 00:02:09,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 00:02:09,046 INFO L208 MainTranslator]: Completed translation [2022-07-12 00:02:09,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:02:09 WrapperNode [2022-07-12 00:02:09,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 00:02:09,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 00:02:09,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 00:02:09,068 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 00:02:09,073 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:02:09" (1/1) ... [2022-07-12 00:02:09,107 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:02:09" (1/1) ... [2022-07-12 00:02:09,276 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1771 [2022-07-12 00:02:09,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 00:02:09,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 00:02:09,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 00:02:09,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 00:02:09,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:02:09" (1/1) ... [2022-07-12 00:02:09,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:02:09" (1/1) ... [2022-07-12 00:02:09,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:02:09" (1/1) ... [2022-07-12 00:02:09,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:02:09" (1/1) ... [2022-07-12 00:02:09,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:02:09" (1/1) ... [2022-07-12 00:02:09,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:02:09" (1/1) ... [2022-07-12 00:02:09,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:02:09" (1/1) ... [2022-07-12 00:02:09,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 00:02:09,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 00:02:09,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 00:02:09,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 00:02:09,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:02:09" (1/1) ... [2022-07-12 00:02:09,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 00:02:09,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 00:02:09,488 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:02:09,507 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:02:09,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 00:02:09,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 00:02:09,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 00:02:09,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 00:02:09,611 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 00:02:09,613 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 00:02:11,181 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 00:02:11,210 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 00:02:11,210 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 00:02:11,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:02:11 BoogieIcfgContainer [2022-07-12 00:02:11,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 00:02:11,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 00:02:11,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 00:02:11,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 00:02:11,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:02:08" (1/3) ... [2022-07-12 00:02:11,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49357c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:02:11, skipping insertion in model container [2022-07-12 00:02:11,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:02:09" (2/3) ... [2022-07-12 00:02:11,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49357c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:02:11, skipping insertion in model container [2022-07-12 00:02:11,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:02:11" (3/3) ... [2022-07-12 00:02:11,221 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem03_label30.c [2022-07-12 00:02:11,241 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 00:02:11,251 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 00:02:11,339 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 00:02:11,359 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@12953a22, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@421bf963 [2022-07-12 00:02:11,359 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 00:02:11,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 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:02:11,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-12 00:02:11,394 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:11,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:11,396 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:11,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:11,401 INFO L85 PathProgramCache]: Analyzing trace with hash 174616531, now seen corresponding path program 1 times [2022-07-12 00:02:11,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:11,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351111499] [2022-07-12 00:02:11,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:11,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:12,200 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:02:12,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:12,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351111499] [2022-07-12 00:02:12,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351111499] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:12,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:02:12,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:02:12,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230703635] [2022-07-12 00:02:12,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:12,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:02:12,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:12,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:02:12,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:02:12,279 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 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 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 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:02:13,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:13,278 INFO L93 Difference]: Finished difference Result 824 states and 1460 transitions. [2022-07-12 00:02:13,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:02:13,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 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 175 [2022-07-12 00:02:13,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:13,289 INFO L225 Difference]: With dead ends: 824 [2022-07-12 00:02:13,289 INFO L226 Difference]: Without dead ends: 444 [2022-07-12 00:02:13,292 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:02:13,294 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 55 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:13,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 238 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 00:02:13,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-07-12 00:02:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 443. [2022-07-12 00:02:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.418552036199095) internal successors, (627), 442 states have internal predecessors, (627), 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:02:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 627 transitions. [2022-07-12 00:02:13,345 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 627 transitions. Word has length 175 [2022-07-12 00:02:13,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:13,346 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 627 transitions. [2022-07-12 00:02:13,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 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:02:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 627 transitions. [2022-07-12 00:02:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-12 00:02:13,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:13,352 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:13,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 00:02:13,353 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:13,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:13,354 INFO L85 PathProgramCache]: Analyzing trace with hash -93879212, now seen corresponding path program 1 times [2022-07-12 00:02:13,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:13,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075649149] [2022-07-12 00:02:13,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:13,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:02:13,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:13,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075649149] [2022-07-12 00:02:13,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075649149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:13,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:02:13,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:02:13,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305692662] [2022-07-12 00:02:13,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:13,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:02:13,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:13,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:02:13,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:02:13,474 INFO L87 Difference]: Start difference. First operand 443 states and 627 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 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:02:14,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:14,272 INFO L93 Difference]: Finished difference Result 1310 states and 1861 transitions. [2022-07-12 00:02:14,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:02:14,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 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 183 [2022-07-12 00:02:14,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:14,279 INFO L225 Difference]: With dead ends: 1310 [2022-07-12 00:02:14,279 INFO L226 Difference]: Without dead ends: 869 [2022-07-12 00:02:14,280 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:02:14,281 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:14,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 92 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 00:02:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-07-12 00:02:14,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 855. [2022-07-12 00:02:14,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 854 states have (on average 1.3875878220140516) internal successors, (1185), 854 states have internal predecessors, (1185), 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:02:14,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1185 transitions. [2022-07-12 00:02:14,320 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1185 transitions. Word has length 183 [2022-07-12 00:02:14,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:14,320 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 1185 transitions. [2022-07-12 00:02:14,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 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:02:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1185 transitions. [2022-07-12 00:02:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-12 00:02:14,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:14,334 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:02:14,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 00:02:14,334 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:14,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:14,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1497909608, now seen corresponding path program 1 times [2022-07-12 00:02:14,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:14,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885647043] [2022-07-12 00:02:14,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:14,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 00:02:14,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:14,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885647043] [2022-07-12 00:02:14,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885647043] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:14,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:02:14,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:02:14,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081918087] [2022-07-12 00:02:14,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:14,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:02:14,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:14,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:02:14,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:02:14,446 INFO L87 Difference]: Start difference. First operand 855 states and 1185 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 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:02:15,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:15,167 INFO L93 Difference]: Finished difference Result 2547 states and 3535 transitions. [2022-07-12 00:02:15,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:02:15,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 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 192 [2022-07-12 00:02:15,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:15,172 INFO L225 Difference]: With dead ends: 2547 [2022-07-12 00:02:15,173 INFO L226 Difference]: Without dead ends: 1694 [2022-07-12 00:02:15,175 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:02:15,180 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 275 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:15,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 227 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 00:02:15,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2022-07-12 00:02:15,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1687. [2022-07-12 00:02:15,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1686 states have (on average 1.3724792408066429) internal successors, (2314), 1686 states have internal predecessors, (2314), 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:02:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2314 transitions. [2022-07-12 00:02:15,213 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2314 transitions. Word has length 192 [2022-07-12 00:02:15,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:15,215 INFO L495 AbstractCegarLoop]: Abstraction has 1687 states and 2314 transitions. [2022-07-12 00:02:15,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 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:02:15,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2314 transitions. [2022-07-12 00:02:15,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-12 00:02:15,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:15,220 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:02:15,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 00:02:15,220 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:15,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:15,221 INFO L85 PathProgramCache]: Analyzing trace with hash 800099661, now seen corresponding path program 1 times [2022-07-12 00:02:15,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:15,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119071870] [2022-07-12 00:02:15,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:15,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 00:02:15,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:15,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119071870] [2022-07-12 00:02:15,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119071870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:15,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:02:15,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:02:15,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034862653] [2022-07-12 00:02:15,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:15,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:02:15,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:15,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:02:15,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:02:15,288 INFO L87 Difference]: Start difference. First operand 1687 states and 2314 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:02:15,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:15,845 INFO L93 Difference]: Finished difference Result 4190 states and 5944 transitions. [2022-07-12 00:02:15,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:02:15,846 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 195 [2022-07-12 00:02:15,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:15,853 INFO L225 Difference]: With dead ends: 4190 [2022-07-12 00:02:15,853 INFO L226 Difference]: Without dead ends: 2505 [2022-07-12 00:02:15,855 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:02:15,856 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 236 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:15,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 405 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:02:15,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2022-07-12 00:02:15,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2502. [2022-07-12 00:02:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2502 states, 2501 states have (on average 1.3102758896441424) internal successors, (3277), 2501 states have internal predecessors, (3277), 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:02:15,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 3277 transitions. [2022-07-12 00:02:15,908 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 3277 transitions. Word has length 195 [2022-07-12 00:02:15,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:15,908 INFO L495 AbstractCegarLoop]: Abstraction has 2502 states and 3277 transitions. [2022-07-12 00:02:15,908 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:02:15,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 3277 transitions. [2022-07-12 00:02:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-12 00:02:15,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:15,912 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:02:15,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 00:02:15,913 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:15,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:15,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1457983073, now seen corresponding path program 1 times [2022-07-12 00:02:15,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:15,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973419510] [2022-07-12 00:02:15,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:15,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:15,970 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 00:02:15,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:15,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973419510] [2022-07-12 00:02:15,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973419510] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:15,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:02:15,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:02:15,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222753028] [2022-07-12 00:02:15,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:15,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:02:15,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:15,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:02:15,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:02:15,972 INFO L87 Difference]: Start difference. First operand 2502 states and 3277 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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:02:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:16,665 INFO L93 Difference]: Finished difference Result 5827 states and 7690 transitions. [2022-07-12 00:02:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:02:16,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 203 [2022-07-12 00:02:16,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:16,675 INFO L225 Difference]: With dead ends: 5827 [2022-07-12 00:02:16,675 INFO L226 Difference]: Without dead ends: 3327 [2022-07-12 00:02:16,680 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:02:16,682 INFO L413 NwaCegarLoop]: 343 mSDtfsCounter, 214 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:16,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 364 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 00:02:16,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3327 states. [2022-07-12 00:02:16,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3327 to 3317. [2022-07-12 00:02:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3316 states have (on average 1.2831724969843186) internal successors, (4255), 3316 states have internal predecessors, (4255), 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:02:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4255 transitions. [2022-07-12 00:02:16,749 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4255 transitions. Word has length 203 [2022-07-12 00:02:16,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:16,750 INFO L495 AbstractCegarLoop]: Abstraction has 3317 states and 4255 transitions. [2022-07-12 00:02:16,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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:02:16,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4255 transitions. [2022-07-12 00:02:16,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-07-12 00:02:16,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:16,756 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:02:16,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 00:02:16,757 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:16,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:16,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1450768731, now seen corresponding path program 1 times [2022-07-12 00:02:16,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:16,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649957674] [2022-07-12 00:02:16,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:16,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 00:02:16,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:16,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649957674] [2022-07-12 00:02:16,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649957674] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:16,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:02:16,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:02:16,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350043481] [2022-07-12 00:02:16,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:16,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:02:16,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:16,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:02:16,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:02:16,823 INFO L87 Difference]: Start difference. First operand 3317 states and 4255 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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:02:17,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:17,420 INFO L93 Difference]: Finished difference Result 9081 states and 11775 transitions. [2022-07-12 00:02:17,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:02:17,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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 210 [2022-07-12 00:02:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:17,435 INFO L225 Difference]: With dead ends: 9081 [2022-07-12 00:02:17,435 INFO L226 Difference]: Without dead ends: 5766 [2022-07-12 00:02:17,440 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:02:17,441 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 202 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:17,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 386 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:02:17,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2022-07-12 00:02:17,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5760. [2022-07-12 00:02:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5760 states, 5759 states have (on average 1.2401458586560166) internal successors, (7142), 5759 states have internal predecessors, (7142), 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:02:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5760 states to 5760 states and 7142 transitions. [2022-07-12 00:02:17,545 INFO L78 Accepts]: Start accepts. Automaton has 5760 states and 7142 transitions. Word has length 210 [2022-07-12 00:02:17,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:17,546 INFO L495 AbstractCegarLoop]: Abstraction has 5760 states and 7142 transitions. [2022-07-12 00:02:17,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 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:02:17,547 INFO L276 IsEmpty]: Start isEmpty. Operand 5760 states and 7142 transitions. [2022-07-12 00:02:17,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-07-12 00:02:17,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:17,554 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:17,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 00:02:17,555 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:17,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:17,555 INFO L85 PathProgramCache]: Analyzing trace with hash 543920742, now seen corresponding path program 1 times [2022-07-12 00:02:17,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:17,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175586855] [2022-07-12 00:02:17,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:17,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:02:17,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:17,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175586855] [2022-07-12 00:02:17,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175586855] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:17,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:02:17,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:02:17,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128267556] [2022-07-12 00:02:17,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:17,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 00:02:17,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:17,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 00:02:17,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:02:17,631 INFO L87 Difference]: Start difference. First operand 5760 states and 7142 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 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:02:18,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:18,565 INFO L93 Difference]: Finished difference Result 11544 states and 14334 transitions. [2022-07-12 00:02:18,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 00:02:18,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 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 219 [2022-07-12 00:02:18,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:18,580 INFO L225 Difference]: With dead ends: 11544 [2022-07-12 00:02:18,581 INFO L226 Difference]: Without dead ends: 5786 [2022-07-12 00:02:18,585 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:02:18,588 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 407 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:18,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 199 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 00:02:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5786 states. [2022-07-12 00:02:18,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5786 to 4948. [2022-07-12 00:02:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4948 states, 4947 states have (on average 1.2460076814230847) internal successors, (6164), 4947 states have internal predecessors, (6164), 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:02:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 6164 transitions. [2022-07-12 00:02:18,650 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 6164 transitions. Word has length 219 [2022-07-12 00:02:18,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:18,651 INFO L495 AbstractCegarLoop]: Abstraction has 4948 states and 6164 transitions. [2022-07-12 00:02:18,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 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:02:18,651 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 6164 transitions. [2022-07-12 00:02:18,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-07-12 00:02:18,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:18,658 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:18,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 00:02:18,658 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:18,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:18,659 INFO L85 PathProgramCache]: Analyzing trace with hash 659726089, now seen corresponding path program 1 times [2022-07-12 00:02:18,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:18,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873931932] [2022-07-12 00:02:18,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:18,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 00:02:18,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:18,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873931932] [2022-07-12 00:02:18,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873931932] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:18,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:02:18,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:02:18,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701715363] [2022-07-12 00:02:18,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:18,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:02:18,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:18,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:02:18,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:02:18,716 INFO L87 Difference]: Start difference. First operand 4948 states and 6164 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 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:02:19,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:19,355 INFO L93 Difference]: Finished difference Result 14393 states and 17935 transitions. [2022-07-12 00:02:19,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:02:19,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 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 223 [2022-07-12 00:02:19,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:19,384 INFO L225 Difference]: With dead ends: 14393 [2022-07-12 00:02:19,384 INFO L226 Difference]: Without dead ends: 9447 [2022-07-12 00:02:19,390 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:02:19,391 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 218 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:19,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 196 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 00:02:19,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9447 states. [2022-07-12 00:02:19,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9447 to 9436. [2022-07-12 00:02:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9436 states, 9435 states have (on average 1.2218335983041866) internal successors, (11528), 9435 states have internal predecessors, (11528), 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:02:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9436 states to 9436 states and 11528 transitions. [2022-07-12 00:02:19,517 INFO L78 Accepts]: Start accepts. Automaton has 9436 states and 11528 transitions. Word has length 223 [2022-07-12 00:02:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:19,518 INFO L495 AbstractCegarLoop]: Abstraction has 9436 states and 11528 transitions. [2022-07-12 00:02:19,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 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:02:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 9436 states and 11528 transitions. [2022-07-12 00:02:19,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-07-12 00:02:19,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:19,530 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:19,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 00:02:19,531 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:19,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:19,531 INFO L85 PathProgramCache]: Analyzing trace with hash 890126555, now seen corresponding path program 1 times [2022-07-12 00:02:19,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:19,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263835877] [2022-07-12 00:02:19,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:19,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 00:02:19,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:19,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263835877] [2022-07-12 00:02:19,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263835877] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 00:02:19,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419776197] [2022-07-12 00:02:19,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:19,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 00:02:19,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 00:02:19,648 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:02:19,683 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:02:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:19,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 00:02:19,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 00:02:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 00:02:20,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 00:02:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 00:02:20,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419776197] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 00:02:20,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 00:02:20,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 6 [2022-07-12 00:02:20,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379860592] [2022-07-12 00:02:20,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 00:02:20,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 00:02:20,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:20,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 00:02:20,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 00:02:20,237 INFO L87 Difference]: Start difference. First operand 9436 states and 11528 transitions. Second operand has 6 states, 6 states have (on average 72.33333333333333) internal successors, (434), 6 states have internal predecessors, (434), 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:02:23,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:23,641 INFO L93 Difference]: Finished difference Result 61772 states and 76379 transitions. [2022-07-12 00:02:23,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 00:02:23,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 72.33333333333333) internal successors, (434), 6 states have internal predecessors, (434), 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 226 [2022-07-12 00:02:23,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:23,857 INFO L225 Difference]: With dead ends: 61772 [2022-07-12 00:02:23,857 INFO L226 Difference]: Without dead ends: 52541 [2022-07-12 00:02:23,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-12 00:02:23,973 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 2651 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 3778 mSolverCounterSat, 1227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2651 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 5005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1227 IncrementalHoareTripleChecker+Valid, 3778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:23,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2651 Valid, 407 Invalid, 5005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1227 Valid, 3778 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-12 00:02:24,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52541 states. [2022-07-12 00:02:25,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52541 to 51667. [2022-07-12 00:02:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51667 states, 51666 states have (on average 1.178066813765339) internal successors, (60866), 51666 states have internal predecessors, (60866), 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:02:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51667 states to 51667 states and 60866 transitions. [2022-07-12 00:02:25,744 INFO L78 Accepts]: Start accepts. Automaton has 51667 states and 60866 transitions. Word has length 226 [2022-07-12 00:02:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:25,745 INFO L495 AbstractCegarLoop]: Abstraction has 51667 states and 60866 transitions. [2022-07-12 00:02:25,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.33333333333333) internal successors, (434), 6 states have internal predecessors, (434), 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:02:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 51667 states and 60866 transitions. [2022-07-12 00:02:25,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-07-12 00:02:25,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:25,819 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, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:25,850 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:02:26,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 00:02:26,038 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:26,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:26,038 INFO L85 PathProgramCache]: Analyzing trace with hash 26999431, now seen corresponding path program 1 times [2022-07-12 00:02:26,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:26,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077961362] [2022-07-12 00:02:26,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:26,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:02:26,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:26,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077961362] [2022-07-12 00:02:26,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077961362] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:26,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:02:26,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:02:26,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397665049] [2022-07-12 00:02:26,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:26,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:02:26,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:26,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:02:26,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:02:26,297 INFO L87 Difference]: Start difference. First operand 51667 states and 60866 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 2 states have internal predecessors, (249), 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:02:27,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:27,431 INFO L93 Difference]: Finished difference Result 102113 states and 120353 transitions. [2022-07-12 00:02:27,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:02:27,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 2 states have internal predecessors, (249), 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 249 [2022-07-12 00:02:27,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:27,627 INFO L225 Difference]: With dead ends: 102113 [2022-07-12 00:02:27,631 INFO L226 Difference]: Without dead ends: 51057 [2022-07-12 00:02:27,695 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:02:27,696 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 133 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:27,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 196 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 00:02:27,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51057 states. [2022-07-12 00:02:28,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51057 to 51056. [2022-07-12 00:02:28,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51056 states, 51055 states have (on average 1.1772206444030946) internal successors, (60103), 51055 states have internal predecessors, (60103), 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:02:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51056 states to 51056 states and 60103 transitions. [2022-07-12 00:02:29,251 INFO L78 Accepts]: Start accepts. Automaton has 51056 states and 60103 transitions. Word has length 249 [2022-07-12 00:02:29,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:29,251 INFO L495 AbstractCegarLoop]: Abstraction has 51056 states and 60103 transitions. [2022-07-12 00:02:29,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 2 states have internal predecessors, (249), 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:02:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 51056 states and 60103 transitions. [2022-07-12 00:02:29,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-12 00:02:29,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:29,327 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 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:02:29,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 00:02:29,328 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:29,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:29,329 INFO L85 PathProgramCache]: Analyzing trace with hash -213655855, now seen corresponding path program 1 times [2022-07-12 00:02:29,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:29,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431668125] [2022-07-12 00:02:29,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:29,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:29,640 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:02:29,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:29,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431668125] [2022-07-12 00:02:29,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431668125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:29,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:02:29,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:02:29,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306850475] [2022-07-12 00:02:29,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:29,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:02:29,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:29,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:02:29,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:02:29,655 INFO L87 Difference]: Start difference. First operand 51056 states and 60103 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 2 states have internal predecessors, (253), 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:02:30,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:30,803 INFO L93 Difference]: Finished difference Result 122493 states and 144278 transitions. [2022-07-12 00:02:30,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:02:30,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 2 states have internal predecessors, (253), 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 253 [2022-07-12 00:02:30,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:31,015 INFO L225 Difference]: With dead ends: 122493 [2022-07-12 00:02:31,015 INFO L226 Difference]: Without dead ends: 72454 [2022-07-12 00:02:31,065 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:02:31,066 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 188 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:31,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 219 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 00:02:31,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72454 states. [2022-07-12 00:02:32,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72454 to 72036. [2022-07-12 00:02:32,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72036 states, 72035 states have (on average 1.169945165544527) internal successors, (84277), 72035 states have internal predecessors, (84277), 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:02:33,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72036 states to 72036 states and 84277 transitions. [2022-07-12 00:02:33,156 INFO L78 Accepts]: Start accepts. Automaton has 72036 states and 84277 transitions. Word has length 253 [2022-07-12 00:02:33,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:33,157 INFO L495 AbstractCegarLoop]: Abstraction has 72036 states and 84277 transitions. [2022-07-12 00:02:33,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 2 states have internal predecessors, (253), 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:02:33,157 INFO L276 IsEmpty]: Start isEmpty. Operand 72036 states and 84277 transitions. [2022-07-12 00:02:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-07-12 00:02:33,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:33,255 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:33,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 00:02:33,256 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:33,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:33,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1780262992, now seen corresponding path program 1 times [2022-07-12 00:02:33,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:33,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462403216] [2022-07-12 00:02:33,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:33,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-12 00:02:33,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:33,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462403216] [2022-07-12 00:02:33,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462403216] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:33,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:02:33,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:02:33,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454935483] [2022-07-12 00:02:33,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:33,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:02:33,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:33,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:02:33,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:02:33,382 INFO L87 Difference]: Start difference. First operand 72036 states and 84277 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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:02:34,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:34,768 INFO L93 Difference]: Finished difference Result 147986 states and 173071 transitions. [2022-07-12 00:02:34,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:02:34,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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:02:34,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:35,140 INFO L225 Difference]: With dead ends: 147986 [2022-07-12 00:02:35,140 INFO L226 Difference]: Without dead ends: 83678 [2022-07-12 00:02:35,224 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:02:35,226 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 241 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:35,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 219 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 00:02:35,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83678 states. [2022-07-12 00:02:36,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83678 to 83654. [2022-07-12 00:02:36,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83654 states, 83653 states have (on average 1.1674297395192044) internal successors, (97659), 83653 states have internal predecessors, (97659), 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:02:36,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83654 states to 83654 states and 97659 transitions. [2022-07-12 00:02:36,485 INFO L78 Accepts]: Start accepts. Automaton has 83654 states and 97659 transitions. Word has length 283 [2022-07-12 00:02:36,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:36,485 INFO L495 AbstractCegarLoop]: Abstraction has 83654 states and 97659 transitions. [2022-07-12 00:02:36,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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:02:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 83654 states and 97659 transitions. [2022-07-12 00:02:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2022-07-12 00:02:36,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:36,602 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:02:36,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 00:02:36,603 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:36,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:36,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1542055283, now seen corresponding path program 1 times [2022-07-12 00:02:36,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:36,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949187036] [2022-07-12 00:02:36,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:36,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 00:02:36,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:36,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949187036] [2022-07-12 00:02:36,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949187036] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:36,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:02:36,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:02:36,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016689320] [2022-07-12 00:02:36,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:36,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 00:02:36,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:36,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 00:02:36,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:02:36,787 INFO L87 Difference]: Start difference. First operand 83654 states and 97659 transitions. Second operand has 4 states, 4 states have (on average 69.75) internal successors, (279), 3 states have internal predecessors, (279), 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:02:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:38,538 INFO L93 Difference]: Finished difference Result 185337 states and 216498 transitions. [2022-07-12 00:02:38,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 00:02:38,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 3 states have internal predecessors, (279), 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 290 [2022-07-12 00:02:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:38,711 INFO L225 Difference]: With dead ends: 185337 [2022-07-12 00:02:38,711 INFO L226 Difference]: Without dead ends: 103717 [2022-07-12 00:02:38,774 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:02:38,777 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 353 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:38,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 169 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 00:02:38,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103717 states. [2022-07-12 00:02:40,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103717 to 94863. [2022-07-12 00:02:40,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94863 states, 94862 states have (on average 1.1641015369694925) internal successors, (110429), 94862 states have internal predecessors, (110429), 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:02:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94863 states to 94863 states and 110429 transitions. [2022-07-12 00:02:40,647 INFO L78 Accepts]: Start accepts. Automaton has 94863 states and 110429 transitions. Word has length 290 [2022-07-12 00:02:40,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:40,648 INFO L495 AbstractCegarLoop]: Abstraction has 94863 states and 110429 transitions. [2022-07-12 00:02:40,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 3 states have internal predecessors, (279), 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:02:40,648 INFO L276 IsEmpty]: Start isEmpty. Operand 94863 states and 110429 transitions. [2022-07-12 00:02:40,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2022-07-12 00:02:40,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:40,718 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:02:40,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 00:02:40,719 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:40,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:40,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1500203540, now seen corresponding path program 1 times [2022-07-12 00:02:40,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:40,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530463225] [2022-07-12 00:02:40,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:40,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 00:02:40,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:40,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530463225] [2022-07-12 00:02:40,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530463225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:40,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:02:40,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:02:40,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386854941] [2022-07-12 00:02:40,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:40,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 00:02:40,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:40,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 00:02:40,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:02:40,950 INFO L87 Difference]: Start difference. First operand 94863 states and 110429 transitions. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 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:02:42,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:42,122 INFO L93 Difference]: Finished difference Result 167798 states and 196240 transitions. [2022-07-12 00:02:42,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 00:02:42,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 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 291 [2022-07-12 00:02:42,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:42,224 INFO L225 Difference]: With dead ends: 167798 [2022-07-12 00:02:42,224 INFO L226 Difference]: Without dead ends: 68067 [2022-07-12 00:02:42,289 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:02:42,290 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 695 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:42,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 45 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 00:02:42,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68067 states. [2022-07-12 00:02:43,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68067 to 67833. [2022-07-12 00:02:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67833 states, 67832 states have (on average 1.0934367260290128) internal successors, (74170), 67832 states have internal predecessors, (74170), 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:02:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67833 states to 67833 states and 74170 transitions. [2022-07-12 00:02:43,624 INFO L78 Accepts]: Start accepts. Automaton has 67833 states and 74170 transitions. Word has length 291 [2022-07-12 00:02:43,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:43,624 INFO L495 AbstractCegarLoop]: Abstraction has 67833 states and 74170 transitions. [2022-07-12 00:02:43,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 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:02:43,624 INFO L276 IsEmpty]: Start isEmpty. Operand 67833 states and 74170 transitions. [2022-07-12 00:02:43,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2022-07-12 00:02:43,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:43,645 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:43,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 00:02:43,645 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:43,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:43,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1717943634, now seen corresponding path program 1 times [2022-07-12 00:02:43,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:43,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438297937] [2022-07-12 00:02:43,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:43,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:44,343 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-12 00:02:44,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:44,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438297937] [2022-07-12 00:02:44,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438297937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:44,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:02:44,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:02:44,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466532265] [2022-07-12 00:02:44,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:44,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:02:44,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:44,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:02:44,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:02:44,354 INFO L87 Difference]: Start difference. First operand 67833 states and 74170 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 2 states have internal predecessors, (243), 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:02:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:45,118 INFO L93 Difference]: Finished difference Result 130741 states and 143823 transitions. [2022-07-12 00:02:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:02:45,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 2 states have internal predecessors, (243), 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 296 [2022-07-12 00:02:45,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:45,202 INFO L225 Difference]: With dead ends: 130741 [2022-07-12 00:02:45,202 INFO L226 Difference]: Without dead ends: 64331 [2022-07-12 00:02:45,249 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:02:45,250 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 151 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:45,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 122 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 00:02:45,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64331 states. [2022-07-12 00:02:46,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64331 to 63316. [2022-07-12 00:02:46,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63316 states, 63315 states have (on average 1.0763168285556346) internal successors, (68147), 63315 states have internal predecessors, (68147), 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:02:46,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63316 states to 63316 states and 68147 transitions. [2022-07-12 00:02:46,290 INFO L78 Accepts]: Start accepts. Automaton has 63316 states and 68147 transitions. Word has length 296 [2022-07-12 00:02:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:46,292 INFO L495 AbstractCegarLoop]: Abstraction has 63316 states and 68147 transitions. [2022-07-12 00:02:46,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 2 states have internal predecessors, (243), 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:02:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 63316 states and 68147 transitions. [2022-07-12 00:02:46,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2022-07-12 00:02:46,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:46,308 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:46,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 00:02:46,309 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:46,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:46,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1588882839, now seen corresponding path program 1 times [2022-07-12 00:02:46,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:46,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213937485] [2022-07-12 00:02:46,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:46,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:46,477 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-12 00:02:46,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:46,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213937485] [2022-07-12 00:02:46,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213937485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:46,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:02:46,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:02:46,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749338019] [2022-07-12 00:02:46,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:46,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:02:46,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:46,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:02:46,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:02:46,480 INFO L87 Difference]: Start difference. First operand 63316 states and 68147 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 2 states have internal predecessors, (230), 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:02:47,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:47,278 INFO L93 Difference]: Finished difference Result 145781 states and 157454 transitions. [2022-07-12 00:02:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:02:47,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 2 states have internal predecessors, (230), 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 303 [2022-07-12 00:02:47,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:47,394 INFO L225 Difference]: With dead ends: 145781 [2022-07-12 00:02:47,394 INFO L226 Difference]: Without dead ends: 82467 [2022-07-12 00:02:48,052 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:02:48,062 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 207 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:48,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 136 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:02:48,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82467 states. [2022-07-12 00:02:48,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82467 to 78991. [2022-07-12 00:02:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78991 states, 78990 states have (on average 1.0816559058108621) internal successors, (85440), 78990 states have internal predecessors, (85440), 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:02:49,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78991 states to 78991 states and 85440 transitions. [2022-07-12 00:02:49,497 INFO L78 Accepts]: Start accepts. Automaton has 78991 states and 85440 transitions. Word has length 303 [2022-07-12 00:02:49,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:49,505 INFO L495 AbstractCegarLoop]: Abstraction has 78991 states and 85440 transitions. [2022-07-12 00:02:49,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 2 states have internal predecessors, (230), 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:02:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand 78991 states and 85440 transitions. [2022-07-12 00:02:49,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2022-07-12 00:02:49,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:49,561 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 00:02:49,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 00:02:49,561 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:49,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:49,562 INFO L85 PathProgramCache]: Analyzing trace with hash -441816732, now seen corresponding path program 1 times [2022-07-12 00:02:49,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:49,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226034999] [2022-07-12 00:02:49,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:49,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 190 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 00:02:49,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:49,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226034999] [2022-07-12 00:02:49,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226034999] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 00:02:49,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739128911] [2022-07-12 00:02:49,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:49,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 00:02:49,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 00:02:49,691 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:02:49,692 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:02:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:49,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 00:02:49,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 00:02:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-12 00:02:50,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 00:02:50,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739128911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:50,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 00:02:50,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-12 00:02:50,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998974952] [2022-07-12 00:02:50,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:50,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:02:50,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:50,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:02:50,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 00:02:50,088 INFO L87 Difference]: Start difference. First operand 78991 states and 85440 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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:02:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:50,908 INFO L93 Difference]: Finished difference Result 155358 states and 168152 transitions. [2022-07-12 00:02:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:02:50,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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 354 [2022-07-12 00:02:50,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:51,028 INFO L225 Difference]: With dead ends: 155358 [2022-07-12 00:02:51,028 INFO L226 Difference]: Without dead ends: 78196 [2022-07-12 00:02:51,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 00:02:51,083 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 86 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:51,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 272 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:02:51,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78196 states. [2022-07-12 00:02:52,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78196 to 78179. [2022-07-12 00:02:52,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78179 states, 78178 states have (on average 1.078065440405229) internal successors, (84281), 78178 states have internal predecessors, (84281), 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:02:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78179 states to 78179 states and 84281 transitions. [2022-07-12 00:02:52,166 INFO L78 Accepts]: Start accepts. Automaton has 78179 states and 84281 transitions. Word has length 354 [2022-07-12 00:02:52,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:52,167 INFO L495 AbstractCegarLoop]: Abstraction has 78179 states and 84281 transitions. [2022-07-12 00:02:52,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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:02:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 78179 states and 84281 transitions. [2022-07-12 00:02:52,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2022-07-12 00:02:52,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:52,197 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:52,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 00:02:52,397 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:02:52,399 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:52,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:52,400 INFO L85 PathProgramCache]: Analyzing trace with hash -393080461, now seen corresponding path program 1 times [2022-07-12 00:02:52,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:52,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057726956] [2022-07-12 00:02:52,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:52,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 215 proven. 29 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 00:02:52,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:52,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057726956] [2022-07-12 00:02:52,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057726956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 00:02:52,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917702341] [2022-07-12 00:02:52,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:52,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 00:02:52,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 00:02:52,508 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:02:52,523 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:02:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:52,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 00:02:52,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 00:02:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 00:02:52,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 00:02:52,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917702341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:52,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 00:02:52,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-07-12 00:02:52,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755213187] [2022-07-12 00:02:52,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:52,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:02:52,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:52,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:02:52,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 00:02:52,700 INFO L87 Difference]: Start difference. First operand 78179 states and 84281 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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:02:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:53,633 INFO L93 Difference]: Finished difference Result 129458 states and 139659 transitions. [2022-07-12 00:02:53,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:02:53,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 362 [2022-07-12 00:02:53,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:53,697 INFO L225 Difference]: With dead ends: 129458 [2022-07-12 00:02:53,697 INFO L226 Difference]: Without dead ends: 50875 [2022-07-12 00:02:53,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 00:02:53,735 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 203 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:53,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 292 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 00:02:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50875 states. [2022-07-12 00:02:54,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50875 to 46601. [2022-07-12 00:02:54,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46601 states, 46600 states have (on average 1.0630257510729613) internal successors, (49537), 46600 states have internal predecessors, (49537), 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:02:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46601 states to 46601 states and 49537 transitions. [2022-07-12 00:02:54,210 INFO L78 Accepts]: Start accepts. Automaton has 46601 states and 49537 transitions. Word has length 362 [2022-07-12 00:02:54,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:54,210 INFO L495 AbstractCegarLoop]: Abstraction has 46601 states and 49537 transitions. [2022-07-12 00:02:54,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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:02:54,211 INFO L276 IsEmpty]: Start isEmpty. Operand 46601 states and 49537 transitions. [2022-07-12 00:02:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2022-07-12 00:02:54,467 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:54,467 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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:02:54,483 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:02:54,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 00:02:54,668 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:54,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:54,670 INFO L85 PathProgramCache]: Analyzing trace with hash 67321743, now seen corresponding path program 1 times [2022-07-12 00:02:54,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:54,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732784596] [2022-07-12 00:02:54,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-12 00:02:54,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:54,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732784596] [2022-07-12 00:02:54,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732784596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:54,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:02:54,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:02:54,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013960936] [2022-07-12 00:02:54,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:54,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:02:54,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:54,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:02:54,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:02:54,841 INFO L87 Difference]: Start difference. First operand 46601 states and 49537 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 2 states have internal predecessors, (315), 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:02:55,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:55,437 INFO L93 Difference]: Finished difference Result 91780 states and 97615 transitions. [2022-07-12 00:02:55,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:02:55,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 2 states have internal predecessors, (315), 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 392 [2022-07-12 00:02:55,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:55,487 INFO L225 Difference]: With dead ends: 91780 [2022-07-12 00:02:55,487 INFO L226 Difference]: Without dead ends: 46602 [2022-07-12 00:02:55,517 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:02:55,517 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 70 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:55,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 116 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 00:02:55,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46602 states. [2022-07-12 00:02:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46602 to 46601. [2022-07-12 00:02:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46601 states, 46600 states have (on average 1.0628969957081544) internal successors, (49531), 46600 states have internal predecessors, (49531), 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:02:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46601 states to 46601 states and 49531 transitions. [2022-07-12 00:02:56,085 INFO L78 Accepts]: Start accepts. Automaton has 46601 states and 49531 transitions. Word has length 392 [2022-07-12 00:02:56,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:56,085 INFO L495 AbstractCegarLoop]: Abstraction has 46601 states and 49531 transitions. [2022-07-12 00:02:56,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 2 states have internal predecessors, (315), 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:02:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 46601 states and 49531 transitions. [2022-07-12 00:02:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2022-07-12 00:02:56,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:56,277 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 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:02:56,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 00:02:56,278 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:56,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:56,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1353325147, now seen corresponding path program 1 times [2022-07-12 00:02:56,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:56,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730027869] [2022-07-12 00:02:56,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:56,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 224 proven. 12 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-12 00:02:56,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:56,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730027869] [2022-07-12 00:02:56,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730027869] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 00:02:56,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808377774] [2022-07-12 00:02:56,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:56,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 00:02:56,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 00:02:56,423 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 00:02:56,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 00:02:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:56,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 00:02:56,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 00:02:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 00:02:56,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 00:02:56,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808377774] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:56,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 00:02:56,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-07-12 00:02:56,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72670583] [2022-07-12 00:02:56,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:56,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:02:56,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:56,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:02:56,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:02:56,824 INFO L87 Difference]: Start difference. First operand 46601 states and 49531 transitions. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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:02:57,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:57,458 INFO L93 Difference]: Finished difference Result 93830 states and 99860 transitions. [2022-07-12 00:02:57,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:02:57,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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 400 [2022-07-12 00:02:57,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:57,508 INFO L225 Difference]: With dead ends: 93830 [2022-07-12 00:02:57,509 INFO L226 Difference]: Without dead ends: 48652 [2022-07-12 00:02:57,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:02:57,536 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 135 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:57,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 332 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 00:02:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48652 states. [2022-07-12 00:02:58,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48652 to 45579. [2022-07-12 00:02:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45579 states, 45578 states have (on average 1.0597876168326825) internal successors, (48303), 45578 states have internal predecessors, (48303), 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:02:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45579 states to 45579 states and 48303 transitions. [2022-07-12 00:02:58,145 INFO L78 Accepts]: Start accepts. Automaton has 45579 states and 48303 transitions. Word has length 400 [2022-07-12 00:02:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:02:58,145 INFO L495 AbstractCegarLoop]: Abstraction has 45579 states and 48303 transitions. [2022-07-12 00:02:58,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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:02:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 45579 states and 48303 transitions. [2022-07-12 00:02:58,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2022-07-12 00:02:58,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:02:58,174 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:02:58,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 00:02:58,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 00:02:58,375 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:02:58,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:02:58,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2084760706, now seen corresponding path program 1 times [2022-07-12 00:02:58,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:02:58,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103725907] [2022-07-12 00:02:58,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:02:58,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:02:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:02:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-12 00:02:58,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:02:58,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103725907] [2022-07-12 00:02:58,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103725907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:02:58,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:02:58,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:02:58,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461617748] [2022-07-12 00:02:58,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:02:58,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 00:02:58,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:02:58,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 00:02:58,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:02:58,500 INFO L87 Difference]: Start difference. First operand 45579 states and 48303 transitions. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 3 states have internal predecessors, (326), 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:02:59,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:02:59,318 INFO L93 Difference]: Finished difference Result 109064 states and 115591 transitions. [2022-07-12 00:02:59,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 00:02:59,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 3 states have internal predecessors, (326), 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 403 [2022-07-12 00:02:59,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:02:59,390 INFO L225 Difference]: With dead ends: 109064 [2022-07-12 00:02:59,390 INFO L226 Difference]: Without dead ends: 64705 [2022-07-12 00:02:59,423 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:02:59,425 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 388 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:02:59,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 386 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:02:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64705 states. [2022-07-12 00:03:00,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64705 to 63683. [2022-07-12 00:03:00,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63683 states, 63682 states have (on average 1.0586979052165446) internal successors, (67420), 63682 states have internal predecessors, (67420), 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:03:00,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63683 states to 63683 states and 67420 transitions. [2022-07-12 00:03:00,293 INFO L78 Accepts]: Start accepts. Automaton has 63683 states and 67420 transitions. Word has length 403 [2022-07-12 00:03:00,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:03:00,293 INFO L495 AbstractCegarLoop]: Abstraction has 63683 states and 67420 transitions. [2022-07-12 00:03:00,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 3 states have internal predecessors, (326), 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:03:00,294 INFO L276 IsEmpty]: Start isEmpty. Operand 63683 states and 67420 transitions. [2022-07-12 00:03:00,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2022-07-12 00:03:00,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:03:00,324 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:03:00,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 00:03:00,324 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:03:00,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:03:00,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1428899627, now seen corresponding path program 1 times [2022-07-12 00:03:00,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:03:00,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527013449] [2022-07-12 00:03:00,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:03:00,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:03:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:03:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 290 proven. 58 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-12 00:03:00,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:03:00,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527013449] [2022-07-12 00:03:00,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527013449] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 00:03:00,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851594043] [2022-07-12 00:03:00,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:03:00,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 00:03:00,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 00:03:00,591 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 00:03:00,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 00:03:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:03:00,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 00:03:00,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 00:03:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-12 00:03:00,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 00:03:00,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851594043] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:03:00,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 00:03:00,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-12 00:03:00,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224434657] [2022-07-12 00:03:00,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:03:00,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:03:00,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:03:00,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:03:00,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 00:03:00,814 INFO L87 Difference]: Start difference. First operand 63683 states and 67420 transitions. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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:03:01,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:03:01,987 INFO L93 Difference]: Finished difference Result 126140 states and 133547 transitions. [2022-07-12 00:03:01,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:03:01,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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 408 [2022-07-12 00:03:01,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:03:02,080 INFO L225 Difference]: With dead ends: 126140 [2022-07-12 00:03:02,080 INFO L226 Difference]: Without dead ends: 63270 [2022-07-12 00:03:02,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 00:03:02,126 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 161 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 00:03:02,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 95 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 00:03:02,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63270 states. [2022-07-12 00:03:02,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63270 to 60217. [2022-07-12 00:03:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60217 states, 60216 states have (on average 1.0528264912979939) internal successors, (63397), 60216 states have internal predecessors, (63397), 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:03:02,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60217 states to 60217 states and 63397 transitions. [2022-07-12 00:03:02,952 INFO L78 Accepts]: Start accepts. Automaton has 60217 states and 63397 transitions. Word has length 408 [2022-07-12 00:03:02,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:03:02,963 INFO L495 AbstractCegarLoop]: Abstraction has 60217 states and 63397 transitions. [2022-07-12 00:03:02,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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:03:02,963 INFO L276 IsEmpty]: Start isEmpty. Operand 60217 states and 63397 transitions. [2022-07-12 00:03:02,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2022-07-12 00:03:02,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:03:02,999 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, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1] [2022-07-12 00:03:03,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 00:03:03,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-12 00:03:03,213 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:03:03,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:03:03,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2000446158, now seen corresponding path program 1 times [2022-07-12 00:03:03,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:03:03,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270074383] [2022-07-12 00:03:03,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:03:03,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:03:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:03:04,229 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 153 proven. 252 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-12 00:03:04,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:03:04,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270074383] [2022-07-12 00:03:04,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270074383] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 00:03:04,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669704355] [2022-07-12 00:03:04,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:03:04,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 00:03:04,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 00:03:04,239 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 00:03:04,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 00:03:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:03:04,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 00:03:04,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 00:03:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-07-12 00:03:04,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 00:03:04,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669704355] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:03:04,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 00:03:04,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-12 00:03:04,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321596565] [2022-07-12 00:03:04,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:03:04,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:03:04,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:03:04,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:03:04,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 00:03:04,721 INFO L87 Difference]: Start difference. First operand 60217 states and 63397 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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:03:05,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:03:05,527 INFO L93 Difference]: Finished difference Result 122079 states and 128707 transitions. [2022-07-12 00:03:05,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:03:05,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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 430 [2022-07-12 00:03:05,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:03:05,529 INFO L225 Difference]: With dead ends: 122079 [2022-07-12 00:03:05,529 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 00:03:05,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 00:03:05,577 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 52 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:03:05,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 312 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:03:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 00:03:05,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 00:03:05,578 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:03:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 00:03:05,578 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 430 [2022-07-12 00:03:05,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:03:05,579 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 00:03:05,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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:03:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 00:03:05,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 00:03:05,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 00:03:05,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 00:03:05,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 00:03:05,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 00:03:17,114 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 543 DAG size of output: 94 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-07-12 00:03:22,988 WARN L233 SmtUtils]: Spent 5.85s on a formula simplification. DAG size of input: 543 DAG size of output: 94 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-07-12 00:03:22,992 INFO L899 garLoopResultBuilder]: For program point L1621(line 1621) no Hoare annotation was computed. [2022-07-12 00:03:22,992 INFO L899 garLoopResultBuilder]: For program point L1555(line 1555) no Hoare annotation was computed. [2022-07-12 00:03:22,992 INFO L899 garLoopResultBuilder]: For program point L498(lines 498 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,992 INFO L899 garLoopResultBuilder]: For program point L1489(line 1489) no Hoare annotation was computed. [2022-07-12 00:03:22,992 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,992 INFO L899 garLoopResultBuilder]: For program point L366(lines 366 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,993 INFO L899 garLoopResultBuilder]: For program point L763(lines 763 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,993 INFO L899 garLoopResultBuilder]: For program point L632(lines 632 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,993 INFO L899 garLoopResultBuilder]: For program point L566(lines 566 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,993 INFO L899 garLoopResultBuilder]: For program point L1623-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:22,993 INFO L899 garLoopResultBuilder]: For program point L1557-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:22,993 INFO L899 garLoopResultBuilder]: For program point L1491-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:22,993 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,993 INFO L899 garLoopResultBuilder]: For program point L1293(lines 1293 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,993 INFO L899 garLoopResultBuilder]: For program point L1624(line 1624) no Hoare annotation was computed. [2022-07-12 00:03:22,993 INFO L899 garLoopResultBuilder]: For program point L1558(line 1558) no Hoare annotation was computed. [2022-07-12 00:03:22,993 INFO L899 garLoopResultBuilder]: For program point L1492(line 1492) no Hoare annotation was computed. [2022-07-12 00:03:22,993 INFO L899 garLoopResultBuilder]: For program point L1360(lines 1360 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,994 INFO L899 garLoopResultBuilder]: For program point L1294(lines 1294 1313) no Hoare annotation was computed. [2022-07-12 00:03:22,994 INFO L899 garLoopResultBuilder]: For program point L1294-2(lines 1294 1313) no Hoare annotation was computed. [2022-07-12 00:03:22,994 INFO L899 garLoopResultBuilder]: For program point L1162(lines 1162 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,994 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,994 INFO L899 garLoopResultBuilder]: For program point L1096(lines 1096 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,994 INFO L899 garLoopResultBuilder]: For program point L1031(lines 1031 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,994 INFO L899 garLoopResultBuilder]: For program point L965(lines 965 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,994 INFO L899 garLoopResultBuilder]: For program point L899(lines 899 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,994 INFO L899 garLoopResultBuilder]: For program point L1626-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:22,994 INFO L899 garLoopResultBuilder]: For program point L1560-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:22,994 INFO L899 garLoopResultBuilder]: For program point L1494-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:22,994 INFO L899 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2022-07-12 00:03:22,994 INFO L899 garLoopResultBuilder]: For program point L1561(line 1561) no Hoare annotation was computed. [2022-07-12 00:03:22,994 INFO L899 garLoopResultBuilder]: For program point L1495(line 1495) no Hoare annotation was computed. [2022-07-12 00:03:22,994 INFO L899 garLoopResultBuilder]: For program point L174(lines 174 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,994 INFO L899 garLoopResultBuilder]: For program point L835(lines 835 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,994 INFO L899 garLoopResultBuilder]: For program point L1629-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:22,994 INFO L899 garLoopResultBuilder]: For program point L1563-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:22,994 INFO L899 garLoopResultBuilder]: For program point L1497-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:22,995 INFO L899 garLoopResultBuilder]: For program point L771(lines 771 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,995 INFO L899 garLoopResultBuilder]: For program point L1630(line 1630) no Hoare annotation was computed. [2022-07-12 00:03:22,995 INFO L899 garLoopResultBuilder]: For program point L1564(line 1564) no Hoare annotation was computed. [2022-07-12 00:03:22,995 INFO L899 garLoopResultBuilder]: For program point L507(lines 507 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,995 INFO L899 garLoopResultBuilder]: For program point L1498(line 1498) no Hoare annotation was computed. [2022-07-12 00:03:22,995 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,995 INFO L899 garLoopResultBuilder]: For program point L508(lines 508 521) no Hoare annotation was computed. [2022-07-12 00:03:22,995 INFO L899 garLoopResultBuilder]: For program point L508-2(lines 508 521) no Hoare annotation was computed. [2022-07-12 00:03:22,995 INFO L899 garLoopResultBuilder]: For program point L1433(lines 1433 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,996 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,996 INFO L899 garLoopResultBuilder]: For program point L1632-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:22,996 INFO L899 garLoopResultBuilder]: For program point L1566-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:22,996 INFO L899 garLoopResultBuilder]: For program point L1500-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:22,996 INFO L899 garLoopResultBuilder]: For program point L311(lines 311 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,996 INFO L899 garLoopResultBuilder]: For program point L1236(lines 1236 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,996 INFO L899 garLoopResultBuilder]: For program point L1633(line 1633) no Hoare annotation was computed. [2022-07-12 00:03:22,997 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,997 INFO L899 garLoopResultBuilder]: For program point L1567(line 1567) no Hoare annotation was computed. [2022-07-12 00:03:22,997 INFO L899 garLoopResultBuilder]: For program point L1501(line 1501) no Hoare annotation was computed. [2022-07-12 00:03:22,997 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,997 INFO L899 garLoopResultBuilder]: For program point L1369(lines 1369 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,998 INFO L899 garLoopResultBuilder]: For program point L1105(lines 1105 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,998 INFO L899 garLoopResultBuilder]: For program point L643(lines 643 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,998 INFO L899 garLoopResultBuilder]: For program point L1370(lines 1370 1389) no Hoare annotation was computed. [2022-07-12 00:03:22,999 INFO L899 garLoopResultBuilder]: For program point L1370-2(lines 1370 1389) no Hoare annotation was computed. [2022-07-12 00:03:22,999 INFO L899 garLoopResultBuilder]: For program point L1172(lines 1172 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,999 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,999 INFO L899 garLoopResultBuilder]: For program point L1635-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:22,999 INFO L899 garLoopResultBuilder]: For program point L1569-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:22,999 INFO L899 garLoopResultBuilder]: For program point L1503-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:22,999 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,999 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,999 INFO L899 garLoopResultBuilder]: For program point L1041(lines 1041 1475) no Hoare annotation was computed. [2022-07-12 00:03:22,999 INFO L899 garLoopResultBuilder]: For program point L909(lines 909 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L711(lines 711 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L1636(line 1636) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L1570(line 1570) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L1504(line 1504) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L976(lines 976 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L779(lines 779 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L1638-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L1572-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L1506-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L846(lines 846 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L1639(line 1639) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L1573(line 1573) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L1507(line 1507) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L451(lines 451 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L1442(lines 1442 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L1641-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L1575-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L1509-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,000 INFO L899 garLoopResultBuilder]: For program point L1642(line 1642) no Hoare annotation was computed. [2022-07-12 00:03:23,001 INFO L899 garLoopResultBuilder]: For program point L1576(line 1576) no Hoare annotation was computed. [2022-07-12 00:03:23,001 INFO L899 garLoopResultBuilder]: For program point L1510(line 1510) no Hoare annotation was computed. [2022-07-12 00:03:23,001 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,001 INFO L899 garLoopResultBuilder]: For program point L1114(lines 1114 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,001 INFO L899 garLoopResultBuilder]: For program point L1048(lines 1048 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,001 INFO L899 garLoopResultBuilder]: For program point L388(lines 388 405) no Hoare annotation was computed. [2022-07-12 00:03:23,001 INFO L899 garLoopResultBuilder]: For program point L322(lines 322 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,001 INFO L899 garLoopResultBuilder]: For program point L388-2(lines 388 405) no Hoare annotation was computed. [2022-07-12 00:03:23,001 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 00:03:23,001 INFO L899 garLoopResultBuilder]: For program point L1247(lines 1247 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,001 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,001 INFO L899 garLoopResultBuilder]: For program point L1049(lines 1049 1069) no Hoare annotation was computed. [2022-07-12 00:03:23,001 INFO L899 garLoopResultBuilder]: For program point L1049-2(lines 1049 1069) no Hoare annotation was computed. [2022-07-12 00:03:23,001 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,001 INFO L899 garLoopResultBuilder]: For program point L719(lines 719 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,002 INFO L899 garLoopResultBuilder]: For program point L653(lines 653 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,002 INFO L899 garLoopResultBuilder]: For program point L1644-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,002 INFO L899 garLoopResultBuilder]: For program point L1578-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,002 INFO L899 garLoopResultBuilder]: For program point L1512-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,002 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,002 INFO L899 garLoopResultBuilder]: For program point L720(lines 720 741) no Hoare annotation was computed. [2022-07-12 00:03:23,002 INFO L899 garLoopResultBuilder]: For program point L720-2(lines 720 741) no Hoare annotation was computed. [2022-07-12 00:03:23,002 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-07-12 00:03:23,002 INFO L899 garLoopResultBuilder]: For program point L1579(line 1579) no Hoare annotation was computed. [2022-07-12 00:03:23,002 INFO L899 garLoopResultBuilder]: For program point L1513(line 1513) no Hoare annotation was computed. [2022-07-12 00:03:23,002 INFO L899 garLoopResultBuilder]: For program point L1315(lines 1315 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,002 INFO L899 garLoopResultBuilder]: For program point L258(lines 258 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,002 INFO L899 garLoopResultBuilder]: For program point L1183(lines 1183 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,002 INFO L899 garLoopResultBuilder]: For program point L985(lines 985 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,002 INFO L899 garLoopResultBuilder]: For program point L787(lines 787 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,002 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,002 INFO L899 garLoopResultBuilder]: For program point L854(lines 854 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,003 INFO L899 garLoopResultBuilder]: For program point L1647-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,003 INFO L899 garLoopResultBuilder]: For program point L1581-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,003 INFO L899 garLoopResultBuilder]: For program point L1515-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,003 INFO L899 garLoopResultBuilder]: For program point L1648(line 1648) no Hoare annotation was computed. [2022-07-12 00:03:23,003 INFO L899 garLoopResultBuilder]: For program point L1582(line 1582) no Hoare annotation was computed. [2022-07-12 00:03:23,003 INFO L899 garLoopResultBuilder]: For program point L1516(line 1516) no Hoare annotation was computed. [2022-07-12 00:03:23,003 INFO L899 garLoopResultBuilder]: For program point L460(lines 460 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,003 INFO L899 garLoopResultBuilder]: For program point L593(lines 593 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,003 INFO L899 garLoopResultBuilder]: For program point L1650-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,003 INFO L899 garLoopResultBuilder]: For program point L1584-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,003 INFO L899 garLoopResultBuilder]: For program point L1518-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,003 INFO L899 garLoopResultBuilder]: For program point L1452(lines 1452 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,003 INFO L899 garLoopResultBuilder]: For program point L329(lines 329 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,003 INFO L899 garLoopResultBuilder]: For program point L1122(lines 1122 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,003 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1570) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L1651(line 1651) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L1585(line 1585) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L1519(line 1519) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 81) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L66-2(lines 66 81) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L794(lines 794 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L1653-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L1587-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L1521-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L1323(lines 1323 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L993(lines 993 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L927(lines 927 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L663(lines 663 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L1654(line 1654) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L1588(line 1588) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L1522(line 1522) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L201(lines 201 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,004 INFO L899 garLoopResultBuilder]: For program point L1192(lines 1192 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L928(lines 928 945) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L928-2(lines 928 945) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L532(lines 532 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L1391(lines 1391 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L1259(lines 1259 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 221) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L202-2(lines 202 221) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L863(lines 863 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L1656-1(lines 1656 1658) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L1590-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L1524-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L1392(lines 1392 1410) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L1392-2(lines 1392 1410) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L1260(lines 1260 1282) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L1260-2(lines 1260 1282) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L1657(line 1657) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L1591(line 1591) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L1525(line 1525) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L468(lines 468 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L1130(lines 1130 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,005 INFO L899 garLoopResultBuilder]: For program point L668(lines 668 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,006 INFO L895 garLoopResultBuilder]: At program point L1659(lines 64 1660) the Hoare annotation is: (let ((.cse10 (= ~a12~0 1)) (.cse2 (= ~a27~0 1))) (let ((.cse12 (= ~a11~0 ~a2~0)) (.cse20 (= ~a26~0 0)) (.cse11 (<= 2 ~a3~0)) (.cse14 (= ~a11~0 0)) (.cse4 (= ~a12~0 ~a8~0)) (.cse18 (= ~a15~0 1)) (.cse6 (not .cse2)) (.cse13 (= ~a16~0 1)) (.cse8 (not .cse10)) (.cse19 (= ~a12~0 ~a6~0)) (.cse5 (<= ~a6~0 0)) (.cse9 (= ~a26~0 1)) (.cse16 (= ~a3~0 1)) (.cse15 (= ~a0~0 1)) (.cse0 (= ~a5~0 1)) (.cse1 (not (= ~a7~0 1))) (.cse17 (= ~a11~0 1)) (.cse7 (= ~a6~0 1)) (.cse3 (= ~a3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse7 .cse8 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse11 .cse1 .cse5) (and .cse0 .cse10 .cse1 .cse12 .cse3 .cse5) (and .cse9 .cse0 .cse10 .cse11 .cse13 .cse1 .cse14 .cse2 .cse15) (and .cse0 .cse11 .cse1 .cse7 .cse2) (and .cse9 .cse0 .cse1 .cse16 .cse7 .cse2) (and .cse9 .cse0 .cse10 .cse1 .cse17 .cse16 .cse2) (and .cse18 .cse0 .cse6 .cse13 .cse1 .cse17 .cse15 .cse19 .cse3) (and .cse9 .cse0 .cse17 .cse2 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse12 .cse7 .cse3) (and .cse9 .cse0 .cse10 .cse2 .cse3) (and .cse9 .cse0 .cse10 .cse13 .cse17 .cse3 .cse4) (and .cse0 .cse1 .cse12 .cse16 .cse7) (and .cse0 .cse11 .cse1 .cse7 .cse8) (and .cse20 .cse0 .cse1 .cse16 .cse7 .cse15) (and .cse0 .cse6 .cse13 .cse1 .cse7 .cse15 .cse3) (and .cse9 .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse18 .cse0 .cse11 .cse13 .cse1 .cse17 .cse19 .cse5) (and .cse0 .cse1 .cse12 .cse7 .cse2 .cse3) (and .cse9 .cse0 .cse11 .cse1 .cse12 .cse7) (and .cse0 .cse6 .cse1 .cse16 .cse8 .cse5) (and .cse0 .cse1 .cse17 .cse16 .cse5) (and .cse18 .cse9 .cse0 .cse1 .cse2 .cse19 .cse3 .cse5) (and .cse0 .cse6 .cse1 .cse7 .cse8 .cse15 .cse3) (and .cse0 .cse11 .cse1 .cse2 .cse15 .cse5) (and .cse20 .cse0 .cse6 .cse13 .cse1 .cse17 .cse16 .cse7) (and .cse0 .cse11 .cse1 .cse17 .cse2 .cse5) (and .cse0 .cse11 .cse13 .cse1 .cse7 .cse15) (and .cse9 .cse0 .cse11 .cse1 .cse2 .cse5) (and .cse0 .cse11 .cse1 .cse17 .cse8 .cse15 .cse5) (and .cse0 .cse6 .cse1 .cse16 .cse7 .cse8) (and .cse18 .cse9 .cse0 .cse1 .cse17 .cse7 .cse19 .cse3) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse5) (and .cse0 .cse10 .cse13 .cse1 .cse15 .cse3 .cse5) (and .cse9 .cse0 .cse17 .cse7 .cse2 .cse3) (and .cse9 .cse0 .cse1 .cse17 .cse7 .cse15 .cse3) (and .cse0 .cse6 .cse13 .cse1 .cse14 .cse7 .cse8 .cse3) (and .cse0 .cse1 .cse17 .cse8 .cse15 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse18 .cse9 .cse0 .cse16 .cse7 .cse2 .cse19) (and .cse0 .cse1 .cse16 .cse15 .cse5) (and .cse18 .cse0 .cse6 .cse13 .cse1 .cse17 .cse16 .cse8 .cse19) (and .cse0 .cse1 .cse17 .cse2 .cse3 .cse5) (and .cse9 .cse0 .cse17 .cse16 .cse7 .cse2) (and .cse0 .cse1 .cse16 .cse7 .cse2 .cse15) (and .cse0 .cse1 .cse17 .cse7 .cse2 .cse3)))) [2022-07-12 00:03:23,006 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,006 INFO L899 garLoopResultBuilder]: For program point L1593-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,006 INFO L899 garLoopResultBuilder]: For program point L1527-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,006 INFO L899 garLoopResultBuilder]: For program point L1594(line 1594) no Hoare annotation was computed. [2022-07-12 00:03:23,006 INFO L899 garLoopResultBuilder]: For program point L1528(line 1528) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L1462(lines 1462 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L1331(lines 1331 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L902 garLoopResultBuilder]: At program point L1662(lines 1662 1679) the Hoare annotation is: true [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L539(lines 539 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L1596-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L1530-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L275(lines 275 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L1200(lines 1200 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L1597(line 1597) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L1531(line 1531) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L805(lines 805 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L1004(lines 1004 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L1599-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L1533-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L1137(lines 1137 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L1071(lines 1071 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L873(lines 873 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,007 INFO L899 garLoopResultBuilder]: For program point L675(lines 675 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,008 INFO L899 garLoopResultBuilder]: For program point L1600(line 1600) no Hoare annotation was computed. [2022-07-12 00:03:23,008 INFO L899 garLoopResultBuilder]: For program point L1534(line 1534) no Hoare annotation was computed. [2022-07-12 00:03:23,008 INFO L899 garLoopResultBuilder]: For program point L477(lines 477 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,008 INFO L899 garLoopResultBuilder]: For program point L1336(lines 1336 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,008 INFO L899 garLoopResultBuilder]: For program point L478(lines 478 488) no Hoare annotation was computed. [2022-07-12 00:03:23,008 INFO L899 garLoopResultBuilder]: For program point L478-2(lines 478 488) no Hoare annotation was computed. [2022-07-12 00:03:23,008 INFO L899 garLoopResultBuilder]: For program point L743(lines 743 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,008 INFO L895 garLoopResultBuilder]: At program point L1668-2(lines 1668 1678) the Hoare annotation is: (let ((.cse10 (= ~a12~0 1)) (.cse2 (= ~a27~0 1))) (let ((.cse12 (= ~a11~0 ~a2~0)) (.cse20 (= ~a26~0 0)) (.cse11 (<= 2 ~a3~0)) (.cse14 (= ~a11~0 0)) (.cse4 (= ~a12~0 ~a8~0)) (.cse18 (= ~a15~0 1)) (.cse6 (not .cse2)) (.cse13 (= ~a16~0 1)) (.cse8 (not .cse10)) (.cse19 (= ~a12~0 ~a6~0)) (.cse5 (<= ~a6~0 0)) (.cse9 (= ~a26~0 1)) (.cse16 (= ~a3~0 1)) (.cse15 (= ~a0~0 1)) (.cse0 (= ~a5~0 1)) (.cse1 (not (= ~a7~0 1))) (.cse17 (= ~a11~0 1)) (.cse7 (= ~a6~0 1)) (.cse3 (= ~a3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse7 .cse8 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse11 .cse1 .cse5) (and .cse0 .cse10 .cse1 .cse12 .cse3 .cse5) (and .cse9 .cse0 .cse10 .cse11 .cse13 .cse1 .cse14 .cse2 .cse15) (and .cse0 .cse11 .cse1 .cse7 .cse2) (and .cse9 .cse0 .cse1 .cse16 .cse7 .cse2) (and .cse9 .cse0 .cse10 .cse1 .cse17 .cse16 .cse2) (and .cse18 .cse0 .cse6 .cse13 .cse1 .cse17 .cse15 .cse19 .cse3) (and .cse9 .cse0 .cse17 .cse2 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse12 .cse7 .cse3) (and .cse9 .cse0 .cse10 .cse2 .cse3) (and .cse9 .cse0 .cse10 .cse13 .cse17 .cse3 .cse4) (and .cse0 .cse1 .cse12 .cse16 .cse7) (and .cse0 .cse11 .cse1 .cse7 .cse8) (and .cse20 .cse0 .cse1 .cse16 .cse7 .cse15) (and .cse0 .cse6 .cse13 .cse1 .cse7 .cse15 .cse3) (and .cse9 .cse0 .cse1 .cse7 .cse2 .cse3) (and .cse18 .cse0 .cse11 .cse13 .cse1 .cse17 .cse19 .cse5) (and .cse0 .cse1 .cse12 .cse7 .cse2 .cse3) (and .cse9 .cse0 .cse11 .cse1 .cse12 .cse7) (and .cse0 .cse6 .cse1 .cse16 .cse8 .cse5) (and .cse0 .cse1 .cse17 .cse16 .cse5) (and .cse18 .cse9 .cse0 .cse1 .cse2 .cse19 .cse3 .cse5) (and .cse0 .cse6 .cse1 .cse7 .cse8 .cse15 .cse3) (and .cse0 .cse11 .cse1 .cse2 .cse15 .cse5) (and .cse20 .cse0 .cse6 .cse13 .cse1 .cse17 .cse16 .cse7) (and .cse0 .cse11 .cse1 .cse17 .cse2 .cse5) (and .cse0 .cse11 .cse13 .cse1 .cse7 .cse15) (and .cse9 .cse0 .cse11 .cse1 .cse2 .cse5) (and .cse0 .cse11 .cse1 .cse17 .cse8 .cse15 .cse5) (and .cse0 .cse6 .cse1 .cse16 .cse7 .cse8) (and .cse18 .cse9 .cse0 .cse1 .cse17 .cse7 .cse19 .cse3) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse5) (and .cse0 .cse10 .cse13 .cse1 .cse15 .cse3 .cse5) (and .cse9 .cse0 .cse17 .cse7 .cse2 .cse3) (and .cse9 .cse0 .cse1 .cse17 .cse7 .cse15 .cse3) (and .cse0 .cse6 .cse13 .cse1 .cse14 .cse7 .cse8 .cse3) (and .cse0 .cse1 .cse17 .cse8 .cse15 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse18 .cse9 .cse0 .cse16 .cse7 .cse2 .cse19) (and .cse0 .cse1 .cse16 .cse15 .cse5) (and .cse18 .cse0 .cse6 .cse13 .cse1 .cse17 .cse16 .cse8 .cse19) (and .cse0 .cse1 .cse17 .cse2 .cse3 .cse5) (and .cse9 .cse0 .cse17 .cse16 .cse7 .cse2) (and .cse0 .cse1 .cse16 .cse7 .cse2 .cse15) (and .cse0 .cse1 .cse17 .cse7 .cse2 .cse3)))) [2022-07-12 00:03:23,008 INFO L899 garLoopResultBuilder]: For program point L1602-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,008 INFO L899 garLoopResultBuilder]: For program point L1536-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,008 INFO L899 garLoopResultBuilder]: For program point L1470(lines 1470 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,008 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,008 INFO L899 garLoopResultBuilder]: For program point L1603(line 1603) no Hoare annotation was computed. [2022-07-12 00:03:23,008 INFO L899 garLoopResultBuilder]: For program point L1537(line 1537) no Hoare annotation was computed. [2022-07-12 00:03:23,008 INFO L899 garLoopResultBuilder]: For program point L613(lines 613 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,008 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,008 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,009 INFO L899 garLoopResultBuilder]: For program point L1142(lines 1142 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,009 INFO L899 garLoopResultBuilder]: For program point L1076(lines 1076 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,009 INFO L899 garLoopResultBuilder]: For program point L878(lines 878 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,009 INFO L899 garLoopResultBuilder]: For program point L1605-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,009 INFO L899 garLoopResultBuilder]: For program point L1539-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,009 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 00:03:23,009 INFO L899 garLoopResultBuilder]: For program point L879(lines 879 897) no Hoare annotation was computed. [2022-07-12 00:03:23,009 INFO L899 garLoopResultBuilder]: For program point L879-2(lines 879 897) no Hoare annotation was computed. [2022-07-12 00:03:23,009 INFO L899 garLoopResultBuilder]: For program point L1606(line 1606) no Hoare annotation was computed. [2022-07-12 00:03:23,009 INFO L899 garLoopResultBuilder]: For program point L549(lines 549 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,009 INFO L899 garLoopResultBuilder]: For program point L1540(line 1540) no Hoare annotation was computed. [2022-07-12 00:03:23,009 INFO L899 garLoopResultBuilder]: For program point L1210(lines 1210 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,009 INFO L899 garLoopResultBuilder]: For program point L814(lines 814 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,009 INFO L899 garLoopResultBuilder]: For program point L1673(line 1673) no Hoare annotation was computed. [2022-07-12 00:03:23,009 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,009 INFO L899 garLoopResultBuilder]: For program point L1013(lines 1013 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,009 INFO L899 garLoopResultBuilder]: For program point L947(lines 947 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,009 INFO L899 garLoopResultBuilder]: For program point L1608-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,009 INFO L899 garLoopResultBuilder]: For program point L1542-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,010 INFO L899 garLoopResultBuilder]: For program point L1476(lines 1476 1478) no Hoare annotation was computed. [2022-07-12 00:03:23,010 INFO L899 garLoopResultBuilder]: For program point L1476-2(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,010 INFO L899 garLoopResultBuilder]: For program point L1609(line 1609) no Hoare annotation was computed. [2022-07-12 00:03:23,010 INFO L899 garLoopResultBuilder]: For program point L1543(line 1543) no Hoare annotation was computed. [2022-07-12 00:03:23,010 INFO L899 garLoopResultBuilder]: For program point L1477(line 1477) no Hoare annotation was computed. [2022-07-12 00:03:23,010 INFO L899 garLoopResultBuilder]: For program point L156(lines 156 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,010 INFO L899 garLoopResultBuilder]: For program point L685(lines 685 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,010 INFO L899 garLoopResultBuilder]: For program point L1412(lines 1412 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,011 INFO L899 garLoopResultBuilder]: For program point L1346(lines 1346 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,011 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,011 INFO L899 garLoopResultBuilder]: For program point L1611-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,012 INFO L899 garLoopResultBuilder]: For program point L1545-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,012 INFO L899 garLoopResultBuilder]: For program point L1479-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,012 INFO L899 garLoopResultBuilder]: For program point L1413(lines 1413 1431) no Hoare annotation was computed. [2022-07-12 00:03:23,012 INFO L899 garLoopResultBuilder]: For program point L1413-2(lines 1413 1431) no Hoare annotation was computed. [2022-07-12 00:03:23,012 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,012 INFO L899 garLoopResultBuilder]: For program point L753(lines 753 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,012 INFO L899 garLoopResultBuilder]: For program point L1612(line 1612) no Hoare annotation was computed. [2022-07-12 00:03:23,012 INFO L899 garLoopResultBuilder]: For program point L1546(line 1546) no Hoare annotation was computed. [2022-07-12 00:03:23,012 INFO L899 garLoopResultBuilder]: For program point L1480(line 1480) no Hoare annotation was computed. [2022-07-12 00:03:23,012 INFO L899 garLoopResultBuilder]: For program point L1084(lines 1084 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,012 INFO L899 garLoopResultBuilder]: For program point L556(lines 556 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,012 INFO L899 garLoopResultBuilder]: For program point L490(lines 490 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,012 INFO L899 garLoopResultBuilder]: For program point L424(lines 424 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,012 INFO L899 garLoopResultBuilder]: For program point L358(lines 358 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,013 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 00:03:23,013 INFO L899 garLoopResultBuilder]: For program point L1614-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,013 INFO L899 garLoopResultBuilder]: For program point L1548-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,013 INFO L899 garLoopResultBuilder]: For program point L1482-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,013 INFO L899 garLoopResultBuilder]: For program point L1284(lines 1284 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,013 INFO L899 garLoopResultBuilder]: For program point L1152(lines 1152 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,013 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,013 INFO L899 garLoopResultBuilder]: For program point L1615(line 1615) no Hoare annotation was computed. [2022-07-12 00:03:23,013 INFO L899 garLoopResultBuilder]: For program point L1549(line 1549) no Hoare annotation was computed. [2022-07-12 00:03:23,013 INFO L899 garLoopResultBuilder]: For program point L1483(line 1483) no Hoare annotation was computed. [2022-07-12 00:03:23,013 INFO L899 garLoopResultBuilder]: For program point L294(lines 294 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,013 INFO L899 garLoopResultBuilder]: For program point L1021(lines 1021 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,013 INFO L899 garLoopResultBuilder]: For program point L823(lines 823 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,013 INFO L899 garLoopResultBuilder]: For program point L1220(lines 1220 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,013 INFO L899 garLoopResultBuilder]: For program point L1617-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,013 INFO L899 garLoopResultBuilder]: For program point L1551-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,013 INFO L899 garLoopResultBuilder]: For program point L1485-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,014 INFO L899 garLoopResultBuilder]: For program point L1221(lines 1221 1234) no Hoare annotation was computed. [2022-07-12 00:03:23,014 INFO L899 garLoopResultBuilder]: For program point L1221-2(lines 1221 1234) no Hoare annotation was computed. [2022-07-12 00:03:23,014 INFO L899 garLoopResultBuilder]: For program point L957(lines 957 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,014 INFO L899 garLoopResultBuilder]: For program point L1618(line 1618) no Hoare annotation was computed. [2022-07-12 00:03:23,014 INFO L899 garLoopResultBuilder]: For program point L1552(line 1552) no Hoare annotation was computed. [2022-07-12 00:03:23,014 INFO L899 garLoopResultBuilder]: For program point L1486(line 1486) no Hoare annotation was computed. [2022-07-12 00:03:23,014 INFO L899 garLoopResultBuilder]: For program point L1354(lines 1354 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,014 INFO L899 garLoopResultBuilder]: For program point L165(lines 165 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,014 INFO L899 garLoopResultBuilder]: For program point L99(lines 99 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,014 INFO L899 garLoopResultBuilder]: For program point L694(lines 694 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,015 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 1475) no Hoare annotation was computed. [2022-07-12 00:03:23,015 INFO L899 garLoopResultBuilder]: For program point L695(lines 695 709) no Hoare annotation was computed. [2022-07-12 00:03:23,015 INFO L899 garLoopResultBuilder]: For program point L695-2(lines 695 709) no Hoare annotation was computed. [2022-07-12 00:03:23,015 INFO L899 garLoopResultBuilder]: For program point L1620-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,015 INFO L899 garLoopResultBuilder]: For program point L1554-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,015 INFO L899 garLoopResultBuilder]: For program point L1488-1(lines 64 1660) no Hoare annotation was computed. [2022-07-12 00:03:23,020 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] [2022-07-12 00:03:23,022 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 00:03:23,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 12:03:23 BoogieIcfgContainer [2022-07-12 00:03:23,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 00:03:23,062 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 00:03:23,062 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 00:03:23,063 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 00:03:23,064 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:02:11" (3/4) ... [2022-07-12 00:03:23,068 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 00:03:23,092 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-12 00:03:23,093 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-12 00:03:23,094 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 00:03:23,096 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 00:03:23,197 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 00:03:23,197 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 00:03:23,197 INFO L158 Benchmark]: Toolchain (without parser) took 75081.73ms. Allocated memory was 83.9MB in the beginning and 14.1GB in the end (delta: 14.0GB). Free memory was 56.8MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 5.3GB. Max. memory is 16.1GB. [2022-07-12 00:03:23,198 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 83.9MB. Free memory was 60.5MB in the beginning and 60.5MB in the end (delta: 45.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 00:03:23,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 914.95ms. Allocated memory was 83.9MB in the beginning and 111.1MB in the end (delta: 27.3MB). Free memory was 56.7MB in the beginning and 64.9MB in the end (delta: -8.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-07-12 00:03:23,198 INFO L158 Benchmark]: Boogie Procedure Inliner took 209.00ms. Allocated memory is still 111.1MB. Free memory was 64.9MB in the beginning and 50.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 00:03:23,198 INFO L158 Benchmark]: Boogie Preprocessor took 184.80ms. Allocated memory is still 111.1MB. Free memory was 50.2MB in the beginning and 65.7MB in the end (delta: -15.4MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2022-07-12 00:03:23,199 INFO L158 Benchmark]: RCFGBuilder took 1749.92ms. Allocated memory was 111.1MB in the beginning and 163.6MB in the end (delta: 52.4MB). Free memory was 65.7MB in the beginning and 74.0MB in the end (delta: -8.3MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2022-07-12 00:03:23,200 INFO L158 Benchmark]: TraceAbstraction took 71847.12ms. Allocated memory was 163.6MB in the beginning and 14.1GB in the end (delta: 14.0GB). Free memory was 74.0MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 5.3GB. Max. memory is 16.1GB. [2022-07-12 00:03:23,200 INFO L158 Benchmark]: Witness Printer took 134.63ms. Allocated memory is still 14.1GB. Free memory was 8.8GB in the beginning and 8.8GB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-12 00:03:23,209 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.42ms. Allocated memory is still 83.9MB. Free memory was 60.5MB in the beginning and 60.5MB in the end (delta: 45.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 914.95ms. Allocated memory was 83.9MB in the beginning and 111.1MB in the end (delta: 27.3MB). Free memory was 56.7MB in the beginning and 64.9MB in the end (delta: -8.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 209.00ms. Allocated memory is still 111.1MB. Free memory was 64.9MB in the beginning and 50.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 184.80ms. Allocated memory is still 111.1MB. Free memory was 50.2MB in the beginning and 65.7MB in the end (delta: -15.4MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1749.92ms. Allocated memory was 111.1MB in the beginning and 163.6MB in the end (delta: 52.4MB). Free memory was 65.7MB in the beginning and 74.0MB in the end (delta: -8.3MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. * TraceAbstraction took 71847.12ms. Allocated memory was 163.6MB in the beginning and 14.1GB in the end (delta: 14.0GB). Free memory was 74.0MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 5.3GB. Max. memory is 16.1GB. * Witness Printer took 134.63ms. Allocated memory is still 14.1GB. Free memory was 8.8GB in the beginning and 8.8GB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. 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: 1570]: 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, 302 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.7s, OverallIterations: 23, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.2s, AutomataDifference: 26.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7568 SdHoareTripleChecker+Valid, 17.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7568 mSDsluCounter, 5425 SdHoareTripleChecker+Invalid, 13.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 947 mSDsCounter, 3431 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17987 IncrementalHoareTripleChecker+Invalid, 21418 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3431 mSolverCounterUnsat, 4478 mSDtfsCounter, 17987 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2476 GetRequests, 2426 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94863occurred in iteration=13, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 27226 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 685 NumberOfFragments, 2045 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 5.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 28642 FormulaSimplificationTreeSizeReductionInter, 12.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 8720 NumberOfCodeBlocks, 8720 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 8916 ConstructedInterpolants, 0 QuantifiedInterpolants, 31223 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3708 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 5258/5650 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: 1662]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((a5 == 1 && !(a7 == 1)) && a27 == 1) && a3 == 0) && a12 == a8) && a6 <= 0) || ((((((a5 == 1 && !(a27 == 1)) && !(a7 == 1)) && a6 == 1) && !(a12 == 1)) && a3 == 0) && a12 == a8)) || (((((a26 == 1 && a5 == 1) && a12 == 1) && 2 <= a3) && !(a7 == 1)) && a6 <= 0)) || (((((a5 == 1 && a12 == 1) && !(a7 == 1)) && a11 == a2) && a3 == 0) && a6 <= 0)) || ((((((((a26 == 1 && a5 == 1) && a12 == 1) && 2 <= a3) && a16 == 1) && !(a7 == 1)) && a11 == 0) && a27 == 1) && a0 == 1)) || ((((a5 == 1 && 2 <= a3) && !(a7 == 1)) && a6 == 1) && a27 == 1)) || (((((a26 == 1 && a5 == 1) && !(a7 == 1)) && a3 == 1) && a6 == 1) && a27 == 1)) || ((((((a26 == 1 && a5 == 1) && a12 == 1) && !(a7 == 1)) && a11 == 1) && a3 == 1) && a27 == 1)) || ((((((((a15 == 1 && a5 == 1) && !(a27 == 1)) && a16 == 1) && !(a7 == 1)) && a11 == 1) && a0 == 1) && a12 == a6) && a3 == 0)) || (((((a26 == 1 && a5 == 1) && a11 == 1) && a27 == 1) && a3 == 0) && a6 <= 0)) || (((((a5 == 1 && a12 == 1) && !(a7 == 1)) && a11 == a2) && a6 == 1) && a3 == 0)) || ((((a26 == 1 && a5 == 1) && a12 == 1) && a27 == 1) && a3 == 0)) || ((((((a26 == 1 && a5 == 1) && a12 == 1) && a16 == 1) && a11 == 1) && a3 == 0) && a12 == a8)) || ((((a5 == 1 && !(a7 == 1)) && a11 == a2) && a3 == 1) && a6 == 1)) || ((((a5 == 1 && 2 <= a3) && !(a7 == 1)) && a6 == 1) && !(a12 == 1))) || (((((a26 == 0 && a5 == 1) && !(a7 == 1)) && a3 == 1) && a6 == 1) && a0 == 1)) || ((((((a5 == 1 && !(a27 == 1)) && a16 == 1) && !(a7 == 1)) && a6 == 1) && a0 == 1) && a3 == 0)) || (((((a26 == 1 && a5 == 1) && !(a7 == 1)) && a6 == 1) && a27 == 1) && a3 == 0)) || (((((((a15 == 1 && a5 == 1) && 2 <= a3) && a16 == 1) && !(a7 == 1)) && a11 == 1) && a12 == a6) && a6 <= 0)) || (((((a5 == 1 && !(a7 == 1)) && a11 == a2) && a6 == 1) && a27 == 1) && a3 == 0)) || (((((a26 == 1 && a5 == 1) && 2 <= a3) && !(a7 == 1)) && a11 == a2) && a6 == 1)) || (((((a5 == 1 && !(a27 == 1)) && !(a7 == 1)) && a3 == 1) && !(a12 == 1)) && a6 <= 0)) || ((((a5 == 1 && !(a7 == 1)) && a11 == 1) && a3 == 1) && a6 <= 0)) || (((((((a15 == 1 && a26 == 1) && a5 == 1) && !(a7 == 1)) && a27 == 1) && a12 == a6) && a3 == 0) && a6 <= 0)) || ((((((a5 == 1 && !(a27 == 1)) && !(a7 == 1)) && a6 == 1) && !(a12 == 1)) && a0 == 1) && a3 == 0)) || (((((a5 == 1 && 2 <= a3) && !(a7 == 1)) && a27 == 1) && a0 == 1) && a6 <= 0)) || (((((((a26 == 0 && a5 == 1) && !(a27 == 1)) && a16 == 1) && !(a7 == 1)) && a11 == 1) && a3 == 1) && a6 == 1)) || (((((a5 == 1 && 2 <= a3) && !(a7 == 1)) && a11 == 1) && a27 == 1) && a6 <= 0)) || (((((a5 == 1 && 2 <= a3) && a16 == 1) && !(a7 == 1)) && a6 == 1) && a0 == 1)) || (((((a26 == 1 && a5 == 1) && 2 <= a3) && !(a7 == 1)) && a27 == 1) && a6 <= 0)) || ((((((a5 == 1 && 2 <= a3) && !(a7 == 1)) && a11 == 1) && !(a12 == 1)) && a0 == 1) && a6 <= 0)) || (((((a5 == 1 && !(a27 == 1)) && !(a7 == 1)) && a3 == 1) && a6 == 1) && !(a12 == 1))) || (((((((a15 == 1 && a26 == 1) && a5 == 1) && !(a7 == 1)) && a11 == 1) && a6 == 1) && a12 == a6) && a3 == 0)) || (((((a5 == 1 && !(a7 == 1)) && a27 == 1) && a0 == 1) && a3 == 0) && a6 <= 0)) || ((((((a5 == 1 && a12 == 1) && a16 == 1) && !(a7 == 1)) && a0 == 1) && a3 == 0) && a6 <= 0)) || (((((a26 == 1 && a5 == 1) && a11 == 1) && a6 == 1) && a27 == 1) && a3 == 0)) || ((((((a26 == 1 && a5 == 1) && !(a7 == 1)) && a11 == 1) && a6 == 1) && a0 == 1) && a3 == 0)) || (((((((a5 == 1 && !(a27 == 1)) && a16 == 1) && !(a7 == 1)) && a11 == 0) && a6 == 1) && !(a12 == 1)) && a3 == 0)) || ((((((a5 == 1 && !(a7 == 1)) && a11 == 1) && !(a12 == 1)) && a0 == 1) && a3 == 0) && a6 <= 0)) || (((((a5 == 1 && a12 == 1) && !(a7 == 1)) && a3 == 0) && a12 == a8) && a6 <= 0)) || ((((((a15 == 1 && a26 == 1) && a5 == 1) && a3 == 1) && a6 == 1) && a27 == 1) && a12 == a6)) || ((((a5 == 1 && !(a7 == 1)) && a3 == 1) && a0 == 1) && a6 <= 0)) || ((((((((a15 == 1 && a5 == 1) && !(a27 == 1)) && a16 == 1) && !(a7 == 1)) && a11 == 1) && a3 == 1) && !(a12 == 1)) && a12 == a6)) || (((((a5 == 1 && !(a7 == 1)) && a11 == 1) && a27 == 1) && a3 == 0) && a6 <= 0)) || (((((a26 == 1 && a5 == 1) && a11 == 1) && a3 == 1) && a6 == 1) && a27 == 1)) || (((((a5 == 1 && !(a7 == 1)) && a3 == 1) && a6 == 1) && a27 == 1) && a0 == 1)) || (((((a5 == 1 && !(a7 == 1)) && a11 == 1) && a6 == 1) && a27 == 1) && a3 == 0) - InvariantResult [Line: 1668]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((a5 == 1 && !(a7 == 1)) && a27 == 1) && a3 == 0) && a12 == a8) && a6 <= 0) || ((((((a5 == 1 && !(a27 == 1)) && !(a7 == 1)) && a6 == 1) && !(a12 == 1)) && a3 == 0) && a12 == a8)) || (((((a26 == 1 && a5 == 1) && a12 == 1) && 2 <= a3) && !(a7 == 1)) && a6 <= 0)) || (((((a5 == 1 && a12 == 1) && !(a7 == 1)) && a11 == a2) && a3 == 0) && a6 <= 0)) || ((((((((a26 == 1 && a5 == 1) && a12 == 1) && 2 <= a3) && a16 == 1) && !(a7 == 1)) && a11 == 0) && a27 == 1) && a0 == 1)) || ((((a5 == 1 && 2 <= a3) && !(a7 == 1)) && a6 == 1) && a27 == 1)) || (((((a26 == 1 && a5 == 1) && !(a7 == 1)) && a3 == 1) && a6 == 1) && a27 == 1)) || ((((((a26 == 1 && a5 == 1) && a12 == 1) && !(a7 == 1)) && a11 == 1) && a3 == 1) && a27 == 1)) || ((((((((a15 == 1 && a5 == 1) && !(a27 == 1)) && a16 == 1) && !(a7 == 1)) && a11 == 1) && a0 == 1) && a12 == a6) && a3 == 0)) || (((((a26 == 1 && a5 == 1) && a11 == 1) && a27 == 1) && a3 == 0) && a6 <= 0)) || (((((a5 == 1 && a12 == 1) && !(a7 == 1)) && a11 == a2) && a6 == 1) && a3 == 0)) || ((((a26 == 1 && a5 == 1) && a12 == 1) && a27 == 1) && a3 == 0)) || ((((((a26 == 1 && a5 == 1) && a12 == 1) && a16 == 1) && a11 == 1) && a3 == 0) && a12 == a8)) || ((((a5 == 1 && !(a7 == 1)) && a11 == a2) && a3 == 1) && a6 == 1)) || ((((a5 == 1 && 2 <= a3) && !(a7 == 1)) && a6 == 1) && !(a12 == 1))) || (((((a26 == 0 && a5 == 1) && !(a7 == 1)) && a3 == 1) && a6 == 1) && a0 == 1)) || ((((((a5 == 1 && !(a27 == 1)) && a16 == 1) && !(a7 == 1)) && a6 == 1) && a0 == 1) && a3 == 0)) || (((((a26 == 1 && a5 == 1) && !(a7 == 1)) && a6 == 1) && a27 == 1) && a3 == 0)) || (((((((a15 == 1 && a5 == 1) && 2 <= a3) && a16 == 1) && !(a7 == 1)) && a11 == 1) && a12 == a6) && a6 <= 0)) || (((((a5 == 1 && !(a7 == 1)) && a11 == a2) && a6 == 1) && a27 == 1) && a3 == 0)) || (((((a26 == 1 && a5 == 1) && 2 <= a3) && !(a7 == 1)) && a11 == a2) && a6 == 1)) || (((((a5 == 1 && !(a27 == 1)) && !(a7 == 1)) && a3 == 1) && !(a12 == 1)) && a6 <= 0)) || ((((a5 == 1 && !(a7 == 1)) && a11 == 1) && a3 == 1) && a6 <= 0)) || (((((((a15 == 1 && a26 == 1) && a5 == 1) && !(a7 == 1)) && a27 == 1) && a12 == a6) && a3 == 0) && a6 <= 0)) || ((((((a5 == 1 && !(a27 == 1)) && !(a7 == 1)) && a6 == 1) && !(a12 == 1)) && a0 == 1) && a3 == 0)) || (((((a5 == 1 && 2 <= a3) && !(a7 == 1)) && a27 == 1) && a0 == 1) && a6 <= 0)) || (((((((a26 == 0 && a5 == 1) && !(a27 == 1)) && a16 == 1) && !(a7 == 1)) && a11 == 1) && a3 == 1) && a6 == 1)) || (((((a5 == 1 && 2 <= a3) && !(a7 == 1)) && a11 == 1) && a27 == 1) && a6 <= 0)) || (((((a5 == 1 && 2 <= a3) && a16 == 1) && !(a7 == 1)) && a6 == 1) && a0 == 1)) || (((((a26 == 1 && a5 == 1) && 2 <= a3) && !(a7 == 1)) && a27 == 1) && a6 <= 0)) || ((((((a5 == 1 && 2 <= a3) && !(a7 == 1)) && a11 == 1) && !(a12 == 1)) && a0 == 1) && a6 <= 0)) || (((((a5 == 1 && !(a27 == 1)) && !(a7 == 1)) && a3 == 1) && a6 == 1) && !(a12 == 1))) || (((((((a15 == 1 && a26 == 1) && a5 == 1) && !(a7 == 1)) && a11 == 1) && a6 == 1) && a12 == a6) && a3 == 0)) || (((((a5 == 1 && !(a7 == 1)) && a27 == 1) && a0 == 1) && a3 == 0) && a6 <= 0)) || ((((((a5 == 1 && a12 == 1) && a16 == 1) && !(a7 == 1)) && a0 == 1) && a3 == 0) && a6 <= 0)) || (((((a26 == 1 && a5 == 1) && a11 == 1) && a6 == 1) && a27 == 1) && a3 == 0)) || ((((((a26 == 1 && a5 == 1) && !(a7 == 1)) && a11 == 1) && a6 == 1) && a0 == 1) && a3 == 0)) || (((((((a5 == 1 && !(a27 == 1)) && a16 == 1) && !(a7 == 1)) && a11 == 0) && a6 == 1) && !(a12 == 1)) && a3 == 0)) || ((((((a5 == 1 && !(a7 == 1)) && a11 == 1) && !(a12 == 1)) && a0 == 1) && a3 == 0) && a6 <= 0)) || (((((a5 == 1 && a12 == 1) && !(a7 == 1)) && a3 == 0) && a12 == a8) && a6 <= 0)) || ((((((a15 == 1 && a26 == 1) && a5 == 1) && a3 == 1) && a6 == 1) && a27 == 1) && a12 == a6)) || ((((a5 == 1 && !(a7 == 1)) && a3 == 1) && a0 == 1) && a6 <= 0)) || ((((((((a15 == 1 && a5 == 1) && !(a27 == 1)) && a16 == 1) && !(a7 == 1)) && a11 == 1) && a3 == 1) && !(a12 == 1)) && a12 == a6)) || (((((a5 == 1 && !(a7 == 1)) && a11 == 1) && a27 == 1) && a3 == 0) && a6 <= 0)) || (((((a26 == 1 && a5 == 1) && a11 == 1) && a3 == 1) && a6 == 1) && a27 == 1)) || (((((a5 == 1 && !(a7 == 1)) && a3 == 1) && a6 == 1) && a27 == 1) && a0 == 1)) || (((((a5 == 1 && !(a7 == 1)) && a11 == 1) && a6 == 1) && a27 == 1) && a3 == 0) RESULT: Ultimate proved your program to be correct! [2022-07-12 00:03:23,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE