./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/bitvector/s3_clnt_3.BV.c.cil-1a.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 ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:25:24,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:25:24,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:25:24,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:25:24,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:25:24,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:25:24,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:25:24,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:25:24,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:25:24,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:25:24,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:25:24,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:25:24,430 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:25:24,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:25:24,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:25:24,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:25:24,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:25:24,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:25:24,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:25:24,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:25:24,446 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:25:24,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:25:24,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:25:24,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:25:24,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:25:24,453 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:25:24,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:25:24,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:25:24,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:25:24,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:25:24,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:25:24,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:25:24,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:25:24,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:25:24,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:25:24,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:25:24,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:25:24,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:25:24,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:25:24,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:25:24,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:25:24,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:25:24,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:25:24,491 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:25:24,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:25:24,494 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:25:24,494 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:25:24,494 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:25:24,494 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:25:24,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:25:24,495 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:25:24,495 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:25:24,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:25:24,496 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:25:24,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:25:24,496 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:25:24,496 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:25:24,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:25:24,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:25:24,497 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:25:24,497 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:25:24,497 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:25:24,497 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:25:24,497 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:25:24,498 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:25:24,498 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:25:24,498 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:25:24,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:25:24,498 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:25:24,498 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:25:24,499 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:25:24,499 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:25:24,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:25:24,499 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:25:24,499 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:25:24,499 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:25:24,499 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 -> ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e [2022-07-13 11:25:24,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:25:24,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:25:24,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:25:24,718 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:25:24,718 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:25:24,719 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2022-07-13 11:25:24,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09a85d419/431307406f5f45ae818500bd3cd0cd5e/FLAG46839ed37 [2022-07-13 11:25:25,130 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:25:25,131 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2022-07-13 11:25:25,137 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09a85d419/431307406f5f45ae818500bd3cd0cd5e/FLAG46839ed37 [2022-07-13 11:25:25,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09a85d419/431307406f5f45ae818500bd3cd0cd5e [2022-07-13 11:25:25,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:25:25,520 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:25:25,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:25:25,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:25:25,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:25:25,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:25:25" (1/1) ... [2022-07-13 11:25:25,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d1de50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:25, skipping insertion in model container [2022-07-13 11:25:25,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:25:25" (1/1) ... [2022-07-13 11:25:25,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:25:25,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:25:25,740 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/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2022-07-13 11:25:25,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:25:25,753 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:25:25,786 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/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2022-07-13 11:25:25,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:25:25,795 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:25:25,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:25 WrapperNode [2022-07-13 11:25:25,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:25:25,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:25:25,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:25:25,796 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:25:25,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:25" (1/1) ... [2022-07-13 11:25:25,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:25" (1/1) ... [2022-07-13 11:25:25,837 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 503 [2022-07-13 11:25:25,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:25:25,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:25:25,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:25:25,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:25:25,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:25" (1/1) ... [2022-07-13 11:25:25,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:25" (1/1) ... [2022-07-13 11:25:25,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:25" (1/1) ... [2022-07-13 11:25:25,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:25" (1/1) ... [2022-07-13 11:25:25,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:25" (1/1) ... [2022-07-13 11:25:25,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:25" (1/1) ... [2022-07-13 11:25:25,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:25" (1/1) ... [2022-07-13 11:25:25,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:25:25,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:25:25,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:25:25,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:25:25,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:25" (1/1) ... [2022-07-13 11:25:25,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:25:25,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:25:25,919 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-13 11:25:25,921 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-13 11:25:25,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:25:25,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:25:25,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:25:25,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:25:26,028 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:25:26,029 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:25:26,038 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:25:26,398 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-07-13 11:25:26,398 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-07-13 11:25:26,398 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:25:26,405 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:25:26,405 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:25:26,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:25:26 BoogieIcfgContainer [2022-07-13 11:25:26,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:25:26,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:25:26,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:25:26,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:25:26,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:25:25" (1/3) ... [2022-07-13 11:25:26,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7497fefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:25:26, skipping insertion in model container [2022-07-13 11:25:26,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:25" (2/3) ... [2022-07-13 11:25:26,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7497fefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:25:26, skipping insertion in model container [2022-07-13 11:25:26,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:25:26" (3/3) ... [2022-07-13 11:25:26,413 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.c [2022-07-13 11:25:26,423 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:25:26,423 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:25:26,457 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:25:26,461 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@8fbab7f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@64f37de0 [2022-07-13 11:25:26,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:25:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 132 states have (on average 1.75) internal successors, (231), 133 states have internal predecessors, (231), 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-13 11:25:26,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 11:25:26,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:26,474 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] [2022-07-13 11:25:26,474 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:26,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:26,479 INFO L85 PathProgramCache]: Analyzing trace with hash 260039818, now seen corresponding path program 1 times [2022-07-13 11:25:26,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:26,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723116635] [2022-07-13 11:25:26,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:26,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:26,603 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-13 11:25:26,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:26,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723116635] [2022-07-13 11:25:26,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723116635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:26,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:26,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:26,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228343510] [2022-07-13 11:25:26,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:26,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:26,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:26,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:26,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:26,626 INFO L87 Difference]: Start difference. First operand has 134 states, 132 states have (on average 1.75) internal successors, (231), 133 states have internal predecessors, (231), 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 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-13 11:25:26,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:26,730 INFO L93 Difference]: Finished difference Result 263 states and 455 transitions. [2022-07-13 11:25:26,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:26,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2022-07-13 11:25:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:26,738 INFO L225 Difference]: With dead ends: 263 [2022-07-13 11:25:26,738 INFO L226 Difference]: Without dead ends: 121 [2022-07-13 11:25:26,740 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-13 11:25:26,742 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 8 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:26,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 338 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:26,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-13 11:25:26,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-13 11:25:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.5583333333333333) internal successors, (187), 120 states have internal predecessors, (187), 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-13 11:25:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 187 transitions. [2022-07-13 11:25:26,787 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 187 transitions. Word has length 25 [2022-07-13 11:25:26,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:26,787 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 187 transitions. [2022-07-13 11:25:26,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-13 11:25:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 187 transitions. [2022-07-13 11:25:26,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:25:26,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:26,790 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:26,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:25:26,790 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:26,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:26,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1631610026, now seen corresponding path program 1 times [2022-07-13 11:25:26,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:26,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40879176] [2022-07-13 11:25:26,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:26,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:25:26,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:26,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40879176] [2022-07-13 11:25:26,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40879176] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:26,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:26,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:26,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261933070] [2022-07-13 11:25:26,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:26,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:26,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:26,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:26,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:26,883 INFO L87 Difference]: Start difference. First operand 121 states and 187 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-13 11:25:26,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:26,984 INFO L93 Difference]: Finished difference Result 249 states and 388 transitions. [2022-07-13 11:25:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:26,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2022-07-13 11:25:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:26,988 INFO L225 Difference]: With dead ends: 249 [2022-07-13 11:25:26,989 INFO L226 Difference]: Without dead ends: 139 [2022-07-13 11:25:26,992 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-13 11:25:26,993 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:26,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 259 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:26,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-13 11:25:27,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2022-07-13 11:25:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.5333333333333334) internal successors, (207), 135 states have internal predecessors, (207), 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-13 11:25:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 207 transitions. [2022-07-13 11:25:27,009 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 207 transitions. Word has length 37 [2022-07-13 11:25:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:27,010 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 207 transitions. [2022-07-13 11:25:27,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-13 11:25:27,011 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 207 transitions. [2022-07-13 11:25:27,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-13 11:25:27,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:27,014 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:27,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:25:27,014 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:27,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:27,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1554238703, now seen corresponding path program 1 times [2022-07-13 11:25:27,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:27,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931622456] [2022-07-13 11:25:27,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:27,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:25:27,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:27,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931622456] [2022-07-13 11:25:27,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931622456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:27,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:27,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:27,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690659782] [2022-07-13 11:25:27,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:27,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:27,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:27,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:27,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:27,092 INFO L87 Difference]: Start difference. First operand 136 states and 207 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-13 11:25:27,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:27,103 INFO L93 Difference]: Finished difference Result 287 states and 432 transitions. [2022-07-13 11:25:27,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:27,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 51 [2022-07-13 11:25:27,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:27,108 INFO L225 Difference]: With dead ends: 287 [2022-07-13 11:25:27,108 INFO L226 Difference]: Without dead ends: 162 [2022-07-13 11:25:27,109 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-13 11:25:27,109 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 21 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:27,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 343 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:25:27,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-13 11:25:27,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-07-13 11:25:27,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 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-13 11:25:27,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 240 transitions. [2022-07-13 11:25:27,115 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 240 transitions. Word has length 51 [2022-07-13 11:25:27,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:27,115 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 240 transitions. [2022-07-13 11:25:27,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-13 11:25:27,115 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 240 transitions. [2022-07-13 11:25:27,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-13 11:25:27,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:27,117 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:27,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:25:27,117 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:27,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:27,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1420225197, now seen corresponding path program 1 times [2022-07-13 11:25:27,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:27,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985320379] [2022-07-13 11:25:27,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:27,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:25:27,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:27,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985320379] [2022-07-13 11:25:27,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985320379] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:27,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:27,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:27,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396863729] [2022-07-13 11:25:27,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:27,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:27,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:27,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:27,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:27,153 INFO L87 Difference]: Start difference. First operand 162 states and 240 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-13 11:25:27,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:27,247 INFO L93 Difference]: Finished difference Result 308 states and 467 transitions. [2022-07-13 11:25:27,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:27,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 51 [2022-07-13 11:25:27,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:27,249 INFO L225 Difference]: With dead ends: 308 [2022-07-13 11:25:27,249 INFO L226 Difference]: Without dead ends: 183 [2022-07-13 11:25:27,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:27,250 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 16 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:27,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 272 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:27,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-13 11:25:27,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2022-07-13 11:25:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.4719101123595506) internal successors, (262), 178 states have internal predecessors, (262), 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-13 11:25:27,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 262 transitions. [2022-07-13 11:25:27,256 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 262 transitions. Word has length 51 [2022-07-13 11:25:27,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:27,256 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 262 transitions. [2022-07-13 11:25:27,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-13 11:25:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 262 transitions. [2022-07-13 11:25:27,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-13 11:25:27,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:27,258 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:27,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 11:25:27,258 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:27,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:27,259 INFO L85 PathProgramCache]: Analyzing trace with hash 2017552045, now seen corresponding path program 1 times [2022-07-13 11:25:27,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:27,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587556083] [2022-07-13 11:25:27,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:27,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:25:27,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:27,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587556083] [2022-07-13 11:25:27,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587556083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:27,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:27,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:27,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025882051] [2022-07-13 11:25:27,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:27,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:27,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:27,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:27,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:27,307 INFO L87 Difference]: Start difference. First operand 179 states and 262 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-13 11:25:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:27,436 INFO L93 Difference]: Finished difference Result 363 states and 553 transitions. [2022-07-13 11:25:27,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:27,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 69 [2022-07-13 11:25:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:27,437 INFO L225 Difference]: With dead ends: 363 [2022-07-13 11:25:27,437 INFO L226 Difference]: Without dead ends: 179 [2022-07-13 11:25:27,438 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-13 11:25:27,438 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 27 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:27,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 253 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-13 11:25:27,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-07-13 11:25:27,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.4606741573033708) internal successors, (260), 178 states have internal predecessors, (260), 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-13 11:25:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 260 transitions. [2022-07-13 11:25:27,443 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 260 transitions. Word has length 69 [2022-07-13 11:25:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:27,444 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 260 transitions. [2022-07-13 11:25:27,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-13 11:25:27,444 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 260 transitions. [2022-07-13 11:25:27,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-13 11:25:27,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:27,445 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:25:27,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 11:25:27,446 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:27,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:27,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1856789330, now seen corresponding path program 1 times [2022-07-13 11:25:27,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:27,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375066154] [2022-07-13 11:25:27,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:27,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:27,491 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:25:27,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:27,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375066154] [2022-07-13 11:25:27,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375066154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:27,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:27,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:27,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454242192] [2022-07-13 11:25:27,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:27,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:27,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:27,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:27,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:27,493 INFO L87 Difference]: Start difference. First operand 179 states and 260 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-13 11:25:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:27,508 INFO L93 Difference]: Finished difference Result 492 states and 718 transitions. [2022-07-13 11:25:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:27,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 70 [2022-07-13 11:25:27,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:27,509 INFO L225 Difference]: With dead ends: 492 [2022-07-13 11:25:27,509 INFO L226 Difference]: Without dead ends: 350 [2022-07-13 11:25:27,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:27,510 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 137 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:27,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 350 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:25:27,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-07-13 11:25:27,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2022-07-13 11:25:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.4524495677233429) internal successors, (504), 347 states have internal predecessors, (504), 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-13 11:25:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 504 transitions. [2022-07-13 11:25:27,518 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 504 transitions. Word has length 70 [2022-07-13 11:25:27,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:27,518 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 504 transitions. [2022-07-13 11:25:27,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-13 11:25:27,519 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 504 transitions. [2022-07-13 11:25:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-13 11:25:27,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:27,519 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:25:27,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:25:27,520 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:27,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:27,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1069339995, now seen corresponding path program 1 times [2022-07-13 11:25:27,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:27,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127779106] [2022-07-13 11:25:27,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:27,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:25:27,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:27,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127779106] [2022-07-13 11:25:27,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127779106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:27,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:27,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:27,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090675317] [2022-07-13 11:25:27,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:27,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:27,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:27,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:27,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:27,548 INFO L87 Difference]: Start difference. First operand 348 states and 504 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-13 11:25:27,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:27,562 INFO L93 Difference]: Finished difference Result 759 states and 1111 transitions. [2022-07-13 11:25:27,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:27,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 70 [2022-07-13 11:25:27,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:27,564 INFO L225 Difference]: With dead ends: 759 [2022-07-13 11:25:27,564 INFO L226 Difference]: Without dead ends: 477 [2022-07-13 11:25:27,564 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-13 11:25:27,565 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 131 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:27,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 344 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:25:27,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-07-13 11:25:27,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 475. [2022-07-13 11:25:27,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 474 states have (on average 1.4451476793248945) internal successors, (685), 474 states have internal predecessors, (685), 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-13 11:25:27,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 685 transitions. [2022-07-13 11:25:27,573 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 685 transitions. Word has length 70 [2022-07-13 11:25:27,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:27,573 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 685 transitions. [2022-07-13 11:25:27,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-13 11:25:27,573 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 685 transitions. [2022-07-13 11:25:27,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-13 11:25:27,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:27,574 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:25:27,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 11:25:27,575 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:27,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:27,575 INFO L85 PathProgramCache]: Analyzing trace with hash 751998128, now seen corresponding path program 1 times [2022-07-13 11:25:27,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:27,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593586940] [2022-07-13 11:25:27,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:27,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:27,598 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:25:27,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:27,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593586940] [2022-07-13 11:25:27,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593586940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:27,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:27,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:27,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109265619] [2022-07-13 11:25:27,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:27,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:27,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:27,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:27,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:27,600 INFO L87 Difference]: Start difference. First operand 475 states and 685 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-13 11:25:27,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:27,610 INFO L93 Difference]: Finished difference Result 479 states and 687 transitions. [2022-07-13 11:25:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:27,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 70 [2022-07-13 11:25:27,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:27,612 INFO L225 Difference]: With dead ends: 479 [2022-07-13 11:25:27,612 INFO L226 Difference]: Without dead ends: 341 [2022-07-13 11:25:27,612 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-13 11:25:27,613 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 129 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:27,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 387 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:25:27,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-13 11:25:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2022-07-13 11:25:27,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.4260355029585798) internal successors, (482), 338 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:25:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 482 transitions. [2022-07-13 11:25:27,619 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 482 transitions. Word has length 70 [2022-07-13 11:25:27,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:27,619 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 482 transitions. [2022-07-13 11:25:27,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-13 11:25:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 482 transitions. [2022-07-13 11:25:27,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-13 11:25:27,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:27,621 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:25:27,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 11:25:27,621 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:27,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:27,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1539447463, now seen corresponding path program 1 times [2022-07-13 11:25:27,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:27,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730284182] [2022-07-13 11:25:27,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:27,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:25:27,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:27,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730284182] [2022-07-13 11:25:27,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730284182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:27,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:27,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:27,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454519192] [2022-07-13 11:25:27,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:27,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:27,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:27,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:27,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:27,666 INFO L87 Difference]: Start difference. First operand 339 states and 482 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-13 11:25:27,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:27,676 INFO L93 Difference]: Finished difference Result 478 states and 682 transitions. [2022-07-13 11:25:27,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:27,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 70 [2022-07-13 11:25:27,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:27,677 INFO L225 Difference]: With dead ends: 478 [2022-07-13 11:25:27,677 INFO L226 Difference]: Without dead ends: 341 [2022-07-13 11:25:27,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:27,678 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 125 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:27,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 487 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:25:27,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-13 11:25:27,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2022-07-13 11:25:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.4201183431952662) internal successors, (480), 338 states have internal predecessors, (480), 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-13 11:25:27,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 480 transitions. [2022-07-13 11:25:27,697 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 480 transitions. Word has length 70 [2022-07-13 11:25:27,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:27,697 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 480 transitions. [2022-07-13 11:25:27,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-13 11:25:27,697 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 480 transitions. [2022-07-13 11:25:27,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 11:25:27,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:27,698 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:27,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 11:25:27,698 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:27,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:27,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1979994253, now seen corresponding path program 1 times [2022-07-13 11:25:27,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:27,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439264955] [2022-07-13 11:25:27,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:27,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:25:27,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:27,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439264955] [2022-07-13 11:25:27,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439264955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:27,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:27,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:27,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444348171] [2022-07-13 11:25:27,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:27,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:27,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:27,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:27,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:27,738 INFO L87 Difference]: Start difference. First operand 339 states and 480 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-13 11:25:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:27,760 INFO L93 Difference]: Finished difference Result 881 states and 1267 transitions. [2022-07-13 11:25:27,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:27,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 72 [2022-07-13 11:25:27,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:27,763 INFO L225 Difference]: With dead ends: 881 [2022-07-13 11:25:27,763 INFO L226 Difference]: Without dead ends: 608 [2022-07-13 11:25:27,763 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-13 11:25:27,764 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 130 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:27,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 379 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:25:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-13 11:25:27,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2022-07-13 11:25:27,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 607 states have (on average 1.4168039538714992) internal successors, (860), 607 states have internal predecessors, (860), 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-13 11:25:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 860 transitions. [2022-07-13 11:25:27,775 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 860 transitions. Word has length 72 [2022-07-13 11:25:27,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:27,775 INFO L495 AbstractCegarLoop]: Abstraction has 608 states and 860 transitions. [2022-07-13 11:25:27,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-13 11:25:27,776 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 860 transitions. [2022-07-13 11:25:27,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-13 11:25:27,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:27,777 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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-13 11:25:27,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 11:25:27,777 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:27,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:27,778 INFO L85 PathProgramCache]: Analyzing trace with hash -663990389, now seen corresponding path program 1 times [2022-07-13 11:25:27,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:27,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407420333] [2022-07-13 11:25:27,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:27,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:25:27,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:27,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407420333] [2022-07-13 11:25:27,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407420333] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:27,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:27,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:27,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842941499] [2022-07-13 11:25:27,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:27,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:27,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:27,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:27,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:27,799 INFO L87 Difference]: Start difference. First operand 608 states and 860 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-13 11:25:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:27,816 INFO L93 Difference]: Finished difference Result 1192 states and 1691 transitions. [2022-07-13 11:25:27,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:27,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 73 [2022-07-13 11:25:27,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:27,818 INFO L225 Difference]: With dead ends: 1192 [2022-07-13 11:25:27,819 INFO L226 Difference]: Without dead ends: 650 [2022-07-13 11:25:27,819 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-13 11:25:27,820 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 11 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:27,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 361 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:25:27,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-07-13 11:25:27,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2022-07-13 11:25:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 649 states have (on average 1.4083204930662558) internal successors, (914), 649 states have internal predecessors, (914), 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-13 11:25:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 914 transitions. [2022-07-13 11:25:27,831 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 914 transitions. Word has length 73 [2022-07-13 11:25:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:27,831 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 914 transitions. [2022-07-13 11:25:27,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-13 11:25:27,831 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 914 transitions. [2022-07-13 11:25:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 11:25:27,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:27,832 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-07-13 11:25:27,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 11:25:27,833 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:27,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:27,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1666060429, now seen corresponding path program 1 times [2022-07-13 11:25:27,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:27,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913919453] [2022-07-13 11:25:27,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:27,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:27,862 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 11:25:27,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:27,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913919453] [2022-07-13 11:25:27,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913919453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:27,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:27,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:27,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803369710] [2022-07-13 11:25:27,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:27,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:27,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:27,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:27,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:27,865 INFO L87 Difference]: Start difference. First operand 650 states and 914 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-13 11:25:27,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:27,953 INFO L93 Difference]: Finished difference Result 1330 states and 1909 transitions. [2022-07-13 11:25:27,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:27,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 90 [2022-07-13 11:25:27,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:27,955 INFO L225 Difference]: With dead ends: 1330 [2022-07-13 11:25:27,955 INFO L226 Difference]: Without dead ends: 746 [2022-07-13 11:25:27,956 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-13 11:25:27,957 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:27,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 271 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:27,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-07-13 11:25:27,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 734. [2022-07-13 11:25:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.38881309686221) internal successors, (1018), 733 states have internal predecessors, (1018), 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-13 11:25:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1018 transitions. [2022-07-13 11:25:27,974 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1018 transitions. Word has length 90 [2022-07-13 11:25:27,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:27,975 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1018 transitions. [2022-07-13 11:25:27,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-13 11:25:27,975 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1018 transitions. [2022-07-13 11:25:27,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-13 11:25:27,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:27,976 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2022-07-13 11:25:27,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 11:25:27,977 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:27,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:27,977 INFO L85 PathProgramCache]: Analyzing trace with hash -809022581, now seen corresponding path program 1 times [2022-07-13 11:25:27,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:27,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710685439] [2022-07-13 11:25:27,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:27,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-13 11:25:28,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:28,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710685439] [2022-07-13 11:25:28,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710685439] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:28,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:28,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:28,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530416989] [2022-07-13 11:25:28,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:28,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:28,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:28,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:28,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:28,016 INFO L87 Difference]: Start difference. First operand 734 states and 1018 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-13 11:25:28,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:28,051 INFO L93 Difference]: Finished difference Result 1049 states and 1465 transitions. [2022-07-13 11:25:28,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:28,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 110 [2022-07-13 11:25:28,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:28,054 INFO L225 Difference]: With dead ends: 1049 [2022-07-13 11:25:28,054 INFO L226 Difference]: Without dead ends: 1047 [2022-07-13 11:25:28,055 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-13 11:25:28,055 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 148 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:28,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 321 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:25:28,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2022-07-13 11:25:28,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1047. [2022-07-13 11:25:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 1046 states have (on average 1.3977055449330784) internal successors, (1462), 1046 states have internal predecessors, (1462), 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-13 11:25:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1462 transitions. [2022-07-13 11:25:28,074 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1462 transitions. Word has length 110 [2022-07-13 11:25:28,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:28,074 INFO L495 AbstractCegarLoop]: Abstraction has 1047 states and 1462 transitions. [2022-07-13 11:25:28,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-13 11:25:28,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1462 transitions. [2022-07-13 11:25:28,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-13 11:25:28,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:28,078 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2022-07-13 11:25:28,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 11:25:28,078 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:28,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:28,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2021159997, now seen corresponding path program 1 times [2022-07-13 11:25:28,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:28,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257625363] [2022-07-13 11:25:28,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:28,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-13 11:25:28,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:28,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257625363] [2022-07-13 11:25:28,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257625363] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:28,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:28,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:28,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417006032] [2022-07-13 11:25:28,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:28,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:28,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:28,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:28,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:28,112 INFO L87 Difference]: Start difference. First operand 1047 states and 1462 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-13 11:25:28,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:28,229 INFO L93 Difference]: Finished difference Result 2322 states and 3361 transitions. [2022-07-13 11:25:28,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:28,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 132 [2022-07-13 11:25:28,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:28,233 INFO L225 Difference]: With dead ends: 2322 [2022-07-13 11:25:28,233 INFO L226 Difference]: Without dead ends: 1335 [2022-07-13 11:25:28,234 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-13 11:25:28,235 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 75 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:28,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 246 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:28,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2022-07-13 11:25:28,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1287. [2022-07-13 11:25:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1286 states have (on average 1.4401244167962675) internal successors, (1852), 1286 states have internal predecessors, (1852), 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-13 11:25:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1852 transitions. [2022-07-13 11:25:28,255 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1852 transitions. Word has length 132 [2022-07-13 11:25:28,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:28,255 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1852 transitions. [2022-07-13 11:25:28,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-13 11:25:28,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1852 transitions. [2022-07-13 11:25:28,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-13 11:25:28,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:28,257 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:28,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 11:25:28,258 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:28,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:28,258 INFO L85 PathProgramCache]: Analyzing trace with hash 505572298, now seen corresponding path program 1 times [2022-07-13 11:25:28,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:28,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530301747] [2022-07-13 11:25:28,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:28,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-13 11:25:28,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:28,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530301747] [2022-07-13 11:25:28,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530301747] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:28,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:28,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:28,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974972296] [2022-07-13 11:25:28,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:28,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:28,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:28,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:28,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:28,288 INFO L87 Difference]: Start difference. First operand 1287 states and 1852 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-13 11:25:28,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:28,429 INFO L93 Difference]: Finished difference Result 3062 states and 4552 transitions. [2022-07-13 11:25:28,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:28,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 158 [2022-07-13 11:25:28,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:28,434 INFO L225 Difference]: With dead ends: 3062 [2022-07-13 11:25:28,434 INFO L226 Difference]: Without dead ends: 1739 [2022-07-13 11:25:28,436 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-13 11:25:28,437 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 81 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:28,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 225 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:28,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-07-13 11:25:28,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1665. [2022-07-13 11:25:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1664 states have (on average 1.4158653846153846) internal successors, (2356), 1664 states have internal predecessors, (2356), 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-13 11:25:28,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2356 transitions. [2022-07-13 11:25:28,463 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2356 transitions. Word has length 158 [2022-07-13 11:25:28,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:28,463 INFO L495 AbstractCegarLoop]: Abstraction has 1665 states and 2356 transitions. [2022-07-13 11:25:28,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-13 11:25:28,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2356 transitions. [2022-07-13 11:25:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-13 11:25:28,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:28,466 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:28,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 11:25:28,466 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:28,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:28,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1615904047, now seen corresponding path program 1 times [2022-07-13 11:25:28,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:28,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837349457] [2022-07-13 11:25:28,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:28,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-07-13 11:25:28,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:28,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837349457] [2022-07-13 11:25:28,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837349457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:28,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:28,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:28,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532638161] [2022-07-13 11:25:28,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:28,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:28,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:28,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:28,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:28,504 INFO L87 Difference]: Start difference. First operand 1665 states and 2356 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-13 11:25:28,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:28,621 INFO L93 Difference]: Finished difference Result 3576 states and 5107 transitions. [2022-07-13 11:25:28,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:28,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 179 [2022-07-13 11:25:28,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:28,626 INFO L225 Difference]: With dead ends: 3576 [2022-07-13 11:25:28,626 INFO L226 Difference]: Without dead ends: 1887 [2022-07-13 11:25:28,628 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-13 11:25:28,629 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 84 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:28,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 221 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:28,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2022-07-13 11:25:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1815. [2022-07-13 11:25:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1814 states have (on average 1.4046306504961412) internal successors, (2548), 1814 states have internal predecessors, (2548), 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-13 11:25:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2548 transitions. [2022-07-13 11:25:28,663 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2548 transitions. Word has length 179 [2022-07-13 11:25:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:28,663 INFO L495 AbstractCegarLoop]: Abstraction has 1815 states and 2548 transitions. [2022-07-13 11:25:28,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-13 11:25:28,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2548 transitions. [2022-07-13 11:25:28,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-13 11:25:28,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:28,666 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:28,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 11:25:28,666 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:28,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:28,666 INFO L85 PathProgramCache]: Analyzing trace with hash -68206532, now seen corresponding path program 1 times [2022-07-13 11:25:28,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:28,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458646940] [2022-07-13 11:25:28,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:28,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-07-13 11:25:28,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:28,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458646940] [2022-07-13 11:25:28,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458646940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:28,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:28,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:28,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184961707] [2022-07-13 11:25:28,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:28,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:28,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:28,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:28,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:28,699 INFO L87 Difference]: Start difference. First operand 1815 states and 2548 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-13 11:25:28,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:28,825 INFO L93 Difference]: Finished difference Result 3876 states and 5485 transitions. [2022-07-13 11:25:28,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:28,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-13 11:25:28,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:28,830 INFO L225 Difference]: With dead ends: 3876 [2022-07-13 11:25:28,830 INFO L226 Difference]: Without dead ends: 2049 [2022-07-13 11:25:28,831 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-13 11:25:28,832 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 85 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:28,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 219 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2022-07-13 11:25:28,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1983. [2022-07-13 11:25:28,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1983 states, 1982 states have (on average 1.3975782038345106) internal successors, (2770), 1982 states have internal predecessors, (2770), 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-13 11:25:28,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2770 transitions. [2022-07-13 11:25:28,867 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2770 transitions. Word has length 203 [2022-07-13 11:25:28,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:28,868 INFO L495 AbstractCegarLoop]: Abstraction has 1983 states and 2770 transitions. [2022-07-13 11:25:28,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-13 11:25:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2770 transitions. [2022-07-13 11:25:28,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-13 11:25:28,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:28,870 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:28,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 11:25:28,871 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:28,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:28,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1035557186, now seen corresponding path program 1 times [2022-07-13 11:25:28,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:28,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702119091] [2022-07-13 11:25:28,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:28,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-07-13 11:25:28,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:28,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702119091] [2022-07-13 11:25:28,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702119091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:28,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:28,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:28,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700424198] [2022-07-13 11:25:28,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:28,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:28,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:28,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:28,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:28,904 INFO L87 Difference]: Start difference. First operand 1983 states and 2770 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-13 11:25:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:29,023 INFO L93 Difference]: Finished difference Result 4212 states and 5935 transitions. [2022-07-13 11:25:29,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:29,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-13 11:25:29,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:29,029 INFO L225 Difference]: With dead ends: 4212 [2022-07-13 11:25:29,029 INFO L226 Difference]: Without dead ends: 2241 [2022-07-13 11:25:29,031 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-13 11:25:29,031 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 87 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:29,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 217 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:29,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2022-07-13 11:25:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2169. [2022-07-13 11:25:29,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2168 states have (on average 1.3994464944649447) internal successors, (3034), 2168 states have internal predecessors, (3034), 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-13 11:25:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3034 transitions. [2022-07-13 11:25:29,081 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3034 transitions. Word has length 203 [2022-07-13 11:25:29,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:29,081 INFO L495 AbstractCegarLoop]: Abstraction has 2169 states and 3034 transitions. [2022-07-13 11:25:29,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-13 11:25:29,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3034 transitions. [2022-07-13 11:25:29,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-07-13 11:25:29,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:29,085 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 2, 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] [2022-07-13 11:25:29,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 11:25:29,085 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:29,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:29,085 INFO L85 PathProgramCache]: Analyzing trace with hash 454348542, now seen corresponding path program 1 times [2022-07-13 11:25:29,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:29,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058434300] [2022-07-13 11:25:29,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:29,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:29,122 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2022-07-13 11:25:29,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:29,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058434300] [2022-07-13 11:25:29,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058434300] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:29,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:29,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:29,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566280017] [2022-07-13 11:25:29,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:29,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:29,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:29,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:29,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:29,124 INFO L87 Difference]: Start difference. First operand 2169 states and 3034 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-13 11:25:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:29,244 INFO L93 Difference]: Finished difference Result 4578 states and 6451 transitions. [2022-07-13 11:25:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:29,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 233 [2022-07-13 11:25:29,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:29,250 INFO L225 Difference]: With dead ends: 4578 [2022-07-13 11:25:29,250 INFO L226 Difference]: Without dead ends: 2445 [2022-07-13 11:25:29,252 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-13 11:25:29,253 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 90 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:29,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 211 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:29,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2022-07-13 11:25:29,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2379. [2022-07-13 11:25:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 2378 states have (on average 1.4070647603027755) internal successors, (3346), 2378 states have internal predecessors, (3346), 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-13 11:25:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3346 transitions. [2022-07-13 11:25:29,297 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3346 transitions. Word has length 233 [2022-07-13 11:25:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:29,298 INFO L495 AbstractCegarLoop]: Abstraction has 2379 states and 3346 transitions. [2022-07-13 11:25:29,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-13 11:25:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3346 transitions. [2022-07-13 11:25:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-07-13 11:25:29,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:29,303 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:25:29,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 11:25:29,304 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:29,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:29,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2054712224, now seen corresponding path program 1 times [2022-07-13 11:25:29,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:29,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781496704] [2022-07-13 11:25:29,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:29,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:29,355 INFO L134 CoverageAnalysis]: Checked inductivity of 839 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2022-07-13 11:25:29,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:29,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781496704] [2022-07-13 11:25:29,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781496704] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:29,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:29,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:29,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532290032] [2022-07-13 11:25:29,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:29,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:29,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:29,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:29,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:29,357 INFO L87 Difference]: Start difference. First operand 2379 states and 3346 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-13 11:25:29,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:29,486 INFO L93 Difference]: Finished difference Result 4758 states and 6685 transitions. [2022-07-13 11:25:29,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:29,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 268 [2022-07-13 11:25:29,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:29,493 INFO L225 Difference]: With dead ends: 4758 [2022-07-13 11:25:29,493 INFO L226 Difference]: Without dead ends: 2427 [2022-07-13 11:25:29,495 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-13 11:25:29,496 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 93 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:29,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 206 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:29,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2022-07-13 11:25:29,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 2361. [2022-07-13 11:25:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2361 states, 2360 states have (on average 1.3949152542372882) internal successors, (3292), 2360 states have internal predecessors, (3292), 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-13 11:25:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 3292 transitions. [2022-07-13 11:25:29,540 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 3292 transitions. Word has length 268 [2022-07-13 11:25:29,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:29,540 INFO L495 AbstractCegarLoop]: Abstraction has 2361 states and 3292 transitions. [2022-07-13 11:25:29,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-13 11:25:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 3292 transitions. [2022-07-13 11:25:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2022-07-13 11:25:29,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:29,545 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:29,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 11:25:29,545 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:29,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:29,545 INFO L85 PathProgramCache]: Analyzing trace with hash -671382342, now seen corresponding path program 1 times [2022-07-13 11:25:29,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:29,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076794324] [2022-07-13 11:25:29,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:29,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-07-13 11:25:29,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:29,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076794324] [2022-07-13 11:25:29,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076794324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:29,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:29,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:29,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637968425] [2022-07-13 11:25:29,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:29,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:29,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:29,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:29,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:29,586 INFO L87 Difference]: Start difference. First operand 2361 states and 3292 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-13 11:25:29,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:29,694 INFO L93 Difference]: Finished difference Result 4710 states and 6565 transitions. [2022-07-13 11:25:29,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:29,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 278 [2022-07-13 11:25:29,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:29,701 INFO L225 Difference]: With dead ends: 4710 [2022-07-13 11:25:29,701 INFO L226 Difference]: Without dead ends: 2415 [2022-07-13 11:25:29,703 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-13 11:25:29,703 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 48 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:29,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 265 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:29,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2022-07-13 11:25:29,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 2361. [2022-07-13 11:25:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2361 states, 2360 states have (on average 1.3720338983050848) internal successors, (3238), 2360 states have internal predecessors, (3238), 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-13 11:25:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 3238 transitions. [2022-07-13 11:25:29,756 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 3238 transitions. Word has length 278 [2022-07-13 11:25:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:29,756 INFO L495 AbstractCegarLoop]: Abstraction has 2361 states and 3238 transitions. [2022-07-13 11:25:29,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-13 11:25:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 3238 transitions. [2022-07-13 11:25:29,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2022-07-13 11:25:29,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:29,761 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:29,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 11:25:29,761 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:29,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:29,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1156408394, now seen corresponding path program 1 times [2022-07-13 11:25:29,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:29,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634129048] [2022-07-13 11:25:29,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:29,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2022-07-13 11:25:29,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:29,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634129048] [2022-07-13 11:25:29,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634129048] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:29,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:29,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:29,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318046765] [2022-07-13 11:25:29,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:29,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:29,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:29,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:29,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:29,805 INFO L87 Difference]: Start difference. First operand 2361 states and 3238 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-13 11:25:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:29,920 INFO L93 Difference]: Finished difference Result 4953 states and 6742 transitions. [2022-07-13 11:25:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:29,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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 305 [2022-07-13 11:25:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:29,926 INFO L225 Difference]: With dead ends: 4953 [2022-07-13 11:25:29,926 INFO L226 Difference]: Without dead ends: 2658 [2022-07-13 11:25:29,929 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-13 11:25:29,932 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 106 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:29,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 201 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:29,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2022-07-13 11:25:29,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2448. [2022-07-13 11:25:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2448 states, 2447 states have (on average 1.3710666121781774) internal successors, (3355), 2447 states have internal predecessors, (3355), 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-13 11:25:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 3355 transitions. [2022-07-13 11:25:29,981 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 3355 transitions. Word has length 305 [2022-07-13 11:25:29,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:29,981 INFO L495 AbstractCegarLoop]: Abstraction has 2448 states and 3355 transitions. [2022-07-13 11:25:29,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-13 11:25:29,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 3355 transitions. [2022-07-13 11:25:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2022-07-13 11:25:29,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:29,985 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:29,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 11:25:29,986 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:29,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:29,987 INFO L85 PathProgramCache]: Analyzing trace with hash 619350975, now seen corresponding path program 1 times [2022-07-13 11:25:29,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:29,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920630898] [2022-07-13 11:25:29,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:29,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2022-07-13 11:25:30,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:30,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920630898] [2022-07-13 11:25:30,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920630898] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:30,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:30,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:30,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475199093] [2022-07-13 11:25:30,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:30,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:30,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:30,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:30,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:30,035 INFO L87 Difference]: Start difference. First operand 2448 states and 3355 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-13 11:25:30,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:30,135 INFO L93 Difference]: Finished difference Result 4992 states and 6787 transitions. [2022-07-13 11:25:30,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:30,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 306 [2022-07-13 11:25:30,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:30,151 INFO L225 Difference]: With dead ends: 4992 [2022-07-13 11:25:30,151 INFO L226 Difference]: Without dead ends: 2349 [2022-07-13 11:25:30,154 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-13 11:25:30,154 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:30,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 273 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:30,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2022-07-13 11:25:30,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2343. [2022-07-13 11:25:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.365926558497011) internal successors, (3199), 2342 states have internal predecessors, (3199), 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-13 11:25:30,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3199 transitions. [2022-07-13 11:25:30,195 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3199 transitions. Word has length 306 [2022-07-13 11:25:30,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:30,196 INFO L495 AbstractCegarLoop]: Abstraction has 2343 states and 3199 transitions. [2022-07-13 11:25:30,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-13 11:25:30,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3199 transitions. [2022-07-13 11:25:30,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2022-07-13 11:25:30,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:30,200 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-07-13 11:25:30,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 11:25:30,201 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:30,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:30,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1977728998, now seen corresponding path program 1 times [2022-07-13 11:25:30,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:30,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047825554] [2022-07-13 11:25:30,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:30,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:30,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 476 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-07-13 11:25:30,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:30,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047825554] [2022-07-13 11:25:30,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047825554] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:25:30,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27435112] [2022-07-13 11:25:30,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:30,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:25:30,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:25:30,261 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-13 11:25:30,293 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-13 11:25:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:30,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 11:25:30,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:25:30,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 384 proven. 12 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2022-07-13 11:25:30,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:25:30,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 384 proven. 12 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2022-07-13 11:25:30,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27435112] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:25:30,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:25:30,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-13 11:25:30,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35184168] [2022-07-13 11:25:30,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:25:30,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:25:30,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:30,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:25:30,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:25:30,638 INFO L87 Difference]: Start difference. First operand 2343 states and 3199 transitions. Second operand has 8 states, 8 states have (on average 38.0) internal successors, (304), 8 states have internal predecessors, (304), 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-13 11:25:31,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:31,082 INFO L93 Difference]: Finished difference Result 5675 states and 7940 transitions. [2022-07-13 11:25:31,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:25:31,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 38.0) internal successors, (304), 8 states have internal predecessors, (304), 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 316 [2022-07-13 11:25:31,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:31,087 INFO L225 Difference]: With dead ends: 5675 [2022-07-13 11:25:31,087 INFO L226 Difference]: Without dead ends: 3314 [2022-07-13 11:25:31,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 635 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:25:31,090 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 716 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:31,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 833 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:25:31,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2022-07-13 11:25:31,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 2631. [2022-07-13 11:25:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2631 states, 2630 states have (on average 1.373384030418251) internal successors, (3612), 2630 states have internal predecessors, (3612), 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-13 11:25:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3612 transitions. [2022-07-13 11:25:31,131 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3612 transitions. Word has length 316 [2022-07-13 11:25:31,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:31,131 INFO L495 AbstractCegarLoop]: Abstraction has 2631 states and 3612 transitions. [2022-07-13 11:25:31,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.0) internal successors, (304), 8 states have internal predecessors, (304), 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-13 11:25:31,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3612 transitions. [2022-07-13 11:25:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2022-07-13 11:25:31,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:31,135 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-07-13 11:25:31,153 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-13 11:25:31,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-13 11:25:31,353 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:31,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:31,353 INFO L85 PathProgramCache]: Analyzing trace with hash -761229711, now seen corresponding path program 1 times [2022-07-13 11:25:31,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:31,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750704609] [2022-07-13 11:25:31,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:31,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:31,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 476 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-07-13 11:25:31,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:31,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750704609] [2022-07-13 11:25:31,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750704609] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:25:31,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733299794] [2022-07-13 11:25:31,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:31,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:25:31,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:25:31,432 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-13 11:25:31,449 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-13 11:25:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:31,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:25:31,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:25:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2022-07-13 11:25:31,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:25:31,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733299794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:31,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:25:31,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2022-07-13 11:25:31,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265302246] [2022-07-13 11:25:31,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:31,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:25:31,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:31,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:25:31,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:25:31,699 INFO L87 Difference]: Start difference. First operand 2631 states and 3612 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-13 11:25:31,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:31,849 INFO L93 Difference]: Finished difference Result 3853 states and 5281 transitions. [2022-07-13 11:25:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:25:31,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 317 [2022-07-13 11:25:31,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:31,853 INFO L225 Difference]: With dead ends: 3853 [2022-07-13 11:25:31,853 INFO L226 Difference]: Without dead ends: 2658 [2022-07-13 11:25:31,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:25:31,855 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 447 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:31,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 457 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:31,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2022-07-13 11:25:31,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2586. [2022-07-13 11:25:31,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2586 states, 2585 states have (on average 1.3705996131528047) internal successors, (3543), 2585 states have internal predecessors, (3543), 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-13 11:25:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3543 transitions. [2022-07-13 11:25:31,897 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 3543 transitions. Word has length 317 [2022-07-13 11:25:31,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:31,897 INFO L495 AbstractCegarLoop]: Abstraction has 2586 states and 3543 transitions. [2022-07-13 11:25:31,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-13 11:25:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3543 transitions. [2022-07-13 11:25:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2022-07-13 11:25:31,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:31,902 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 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, 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] [2022-07-13 11:25:31,932 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-13 11:25:32,132 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,SelfDestructingSolverStorable24 [2022-07-13 11:25:32,133 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:32,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:32,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2066727537, now seen corresponding path program 1 times [2022-07-13 11:25:32,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:32,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486622567] [2022-07-13 11:25:32,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:32,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 653 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2022-07-13 11:25:32,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:32,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486622567] [2022-07-13 11:25:32,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486622567] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:25:32,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33264696] [2022-07-13 11:25:32,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:32,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:25:32,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:25:32,185 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-13 11:25:32,186 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-13 11:25:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:32,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:25:32,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:25:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 941 trivial. 0 not checked. [2022-07-13 11:25:32,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:25:32,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33264696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:32,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:25:32,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2022-07-13 11:25:32,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949517169] [2022-07-13 11:25:32,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:32,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:25:32,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:32,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:25:32,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:25:32,403 INFO L87 Difference]: Start difference. First operand 2586 states and 3543 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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-13 11:25:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:32,550 INFO L93 Difference]: Finished difference Result 3606 states and 4893 transitions. [2022-07-13 11:25:32,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:25:32,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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 342 [2022-07-13 11:25:32,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:32,552 INFO L225 Difference]: With dead ends: 3606 [2022-07-13 11:25:32,552 INFO L226 Difference]: Without dead ends: 1187 [2022-07-13 11:25:32,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:25:32,554 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 420 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:32,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 532 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:32,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2022-07-13 11:25:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1187. [2022-07-13 11:25:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1186 states have (on average 1.3625632377740304) internal successors, (1616), 1186 states have internal predecessors, (1616), 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-13 11:25:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1616 transitions. [2022-07-13 11:25:32,572 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1616 transitions. Word has length 342 [2022-07-13 11:25:32,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:32,572 INFO L495 AbstractCegarLoop]: Abstraction has 1187 states and 1616 transitions. [2022-07-13 11:25:32,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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-13 11:25:32,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1616 transitions. [2022-07-13 11:25:32,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2022-07-13 11:25:32,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:32,574 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 10, 10, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:32,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:25:32,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:25:32,788 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:32,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:32,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1232901937, now seen corresponding path program 1 times [2022-07-13 11:25:32,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:32,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850701549] [2022-07-13 11:25:32,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:32,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 813 proven. 12 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2022-07-13 11:25:32,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:32,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850701549] [2022-07-13 11:25:32,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850701549] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:25:32,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989083502] [2022-07-13 11:25:32,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:32,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:25:32,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:25:32,848 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-13 11:25:32,869 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-13 11:25:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:32,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 11:25:32,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:25:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 813 proven. 12 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2022-07-13 11:25:33,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:25:33,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 813 proven. 12 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2022-07-13 11:25:33,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989083502] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:25:33,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:25:33,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-13 11:25:33,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295616387] [2022-07-13 11:25:33,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:25:33,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:25:33,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:33,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:25:33,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:25:33,145 INFO L87 Difference]: Start difference. First operand 1187 states and 1616 transitions. Second operand has 8 states, 8 states have (on average 38.875) internal successors, (311), 8 states have internal predecessors, (311), 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-13 11:25:33,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:33,294 INFO L93 Difference]: Finished difference Result 1992 states and 2726 transitions. [2022-07-13 11:25:33,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:25:33,294 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 38.875) internal successors, (311), 8 states have internal predecessors, (311), 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 393 [2022-07-13 11:25:33,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:33,295 INFO L225 Difference]: With dead ends: 1992 [2022-07-13 11:25:33,295 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 11:25:33,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 784 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:25:33,296 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 107 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:33,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 484 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:25:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 11:25:33,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 11:25:33,297 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-13 11:25:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 11:25:33,297 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 393 [2022-07-13 11:25:33,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:33,297 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 11:25:33,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.875) internal successors, (311), 8 states have internal predecessors, (311), 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-13 11:25:33,298 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 11:25:33,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 11:25:33,300 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:25:33,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-13 11:25:33,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-13 11:25:33,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 11:25:40,850 WARN L233 SmtUtils]: Spent 7.10s on a formula simplification. DAG size of input: 150 DAG size of output: 150 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-13 11:25:42,556 INFO L899 garLoopResultBuilder]: For program point L367(lines 367 371) no Hoare annotation was computed. [2022-07-13 11:25:42,557 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 252) no Hoare annotation was computed. [2022-07-13 11:25:42,557 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 551) no Hoare annotation was computed. [2022-07-13 11:25:42,557 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 562) no Hoare annotation was computed. [2022-07-13 11:25:42,557 INFO L899 garLoopResultBuilder]: For program point L235-2(lines 213 545) no Hoare annotation was computed. [2022-07-13 11:25:42,557 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 573) no Hoare annotation was computed. [2022-07-13 11:25:42,557 INFO L895 garLoopResultBuilder]: At program point L203(lines 199 552) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (or (and (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352) (not .cse0) (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse0 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)))) [2022-07-13 11:25:42,557 INFO L895 garLoopResultBuilder]: At program point L137(lines 133 574) the Hoare annotation is: (let ((.cse7 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse2 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse1 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|)) (.cse4 (not .cse7)) (.cse9 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) (.cse0 (< |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4400)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse8 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)) (.cse5 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse6 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse9 .cse8 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse8 .cse5 .cse6 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|))))) [2022-07-13 11:25:42,557 INFO L899 garLoopResultBuilder]: For program point L501-1(lines 501 513) no Hoare annotation was computed. [2022-07-13 11:25:42,557 INFO L899 garLoopResultBuilder]: For program point L435(lines 435 439) no Hoare annotation was computed. [2022-07-13 11:25:42,557 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 242) no Hoare annotation was computed. [2022-07-13 11:25:42,557 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 550) no Hoare annotation was computed. [2022-07-13 11:25:42,557 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 561) no Hoare annotation was computed. [2022-07-13 11:25:42,557 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 572) no Hoare annotation was computed. [2022-07-13 11:25:42,557 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2022-07-13 11:25:42,557 INFO L895 garLoopResultBuilder]: At program point L206(lines 205 550) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse1 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse4 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)) (.cse7 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse8 (not .cse0)) (.cse5 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse6 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse7 .cse2 .cse3 .cse8 .cse5 .cse6 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))))) [2022-07-13 11:25:42,557 INFO L895 garLoopResultBuilder]: At program point L173(lines 163 564) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4480)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse4 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 .cse1 .cse2 .cse3 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse4 .cse5) (and .cse0 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) .cse2 .cse3 (not .cse1) .cse4 .cse5))) [2022-07-13 11:25:42,557 INFO L899 garLoopResultBuilder]: For program point L504(lines 504 509) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L471(lines 471 482) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L471-1(lines 471 482) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L273-2(lines 213 545) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 410) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L340(lines 340 344) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L340-2(lines 213 545) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 549) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 560) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 571) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L109-1(lines 76 630) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L473(lines 473 479) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L902 garLoopResultBuilder]: At program point L209(lines 208 549) the Hoare annotation is: true [2022-07-13 11:25:42,558 INFO L895 garLoopResultBuilder]: At program point L143(lines 139 572) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432)) (.cse2 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse4 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse5 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse4 .cse5) (and .cse1 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) .cse2 .cse3 (not .cse0) .cse4 .cse5))) [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 248) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L902 garLoopResultBuilder]: At program point L640(lines 632 642) the Hoare annotation is: true [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 314) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L178(lines 178 559) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 570) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 581) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L443(lines 443 447) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L443-2(lines 213 545) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L311(line 311) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L899 garLoopResultBuilder]: For program point L311-2(line 311) no Hoare annotation was computed. [2022-07-13 11:25:42,558 INFO L902 garLoopResultBuilder]: At program point L212(lines 211 548) the Hoare annotation is: true [2022-07-13 11:25:42,560 INFO L895 garLoopResultBuilder]: At program point L179(lines 175 560) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse3 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512))) (or (and .cse0 .cse1 .cse2 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse3 .cse4 .cse5) (and .cse0 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) .cse2 (not .cse1) .cse3 .cse4 .cse5))) [2022-07-13 11:25:42,560 INFO L899 garLoopResultBuilder]: For program point L311-4(line 311) no Hoare annotation was computed. [2022-07-13 11:25:42,560 INFO L895 garLoopResultBuilder]: At program point L113(lines 112 581) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse1 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse3 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)) (.cse4 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse7 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|)) (.cse8 (not .cse0)) (.cse5 (= 12292 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse6 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse3 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse5) (and .cse7 .cse8 .cse5 .cse6)))) [2022-07-13 11:25:42,560 INFO L899 garLoopResultBuilder]: For program point L311-6(line 311) no Hoare annotation was computed. [2022-07-13 11:25:42,560 INFO L899 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2022-07-13 11:25:42,560 INFO L899 garLoopResultBuilder]: For program point L412(lines 412 417) no Hoare annotation was computed. [2022-07-13 11:25:42,560 INFO L899 garLoopResultBuilder]: For program point L412-2(lines 412 417) no Hoare annotation was computed. [2022-07-13 11:25:42,560 INFO L899 garLoopResultBuilder]: For program point L313(line 313) no Hoare annotation was computed. [2022-07-13 11:25:42,560 INFO L899 garLoopResultBuilder]: For program point L313-2(line 313) no Hoare annotation was computed. [2022-07-13 11:25:42,560 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 558) no Hoare annotation was computed. [2022-07-13 11:25:42,560 INFO L899 garLoopResultBuilder]: For program point L313-4(line 313) no Hoare annotation was computed. [2022-07-13 11:25:42,561 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 569) no Hoare annotation was computed. [2022-07-13 11:25:42,561 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 580) no Hoare annotation was computed. [2022-07-13 11:25:42,561 INFO L899 garLoopResultBuilder]: For program point L313-6(line 313) no Hoare annotation was computed. [2022-07-13 11:25:42,561 INFO L899 garLoopResultBuilder]: For program point L313-8(lines 310 314) no Hoare annotation was computed. [2022-07-13 11:25:42,561 INFO L895 garLoopResultBuilder]: At program point L149(lines 145 570) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse3 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse4 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) .cse1 (not .cse2) .cse3 .cse4 .cse5) (and .cse2 .cse0 .cse1 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse3 .cse4 .cse5))) [2022-07-13 11:25:42,561 INFO L895 garLoopResultBuilder]: At program point L546(lines 109 612) the Hoare annotation is: (let ((.cse7 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse3 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) (.cse11 (= 4416 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse6 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse9 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528)) (.cse12 (= 3 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse13 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse1 (= 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse14 (= 4368 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse15 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (.cse8 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)) (.cse16 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (.cse0 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse17 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse4 (not .cse7)) (.cse18 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse5 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse10 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse8 .cse9 .cse5 .cse10) (and .cse7 .cse2 .cse8 .cse11 .cse5 .cse10) (and .cse0 .cse4 .cse12) (and .cse0 .cse13 .cse2 .cse4 .cse5) (and .cse7 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse0 .cse2 .cse4 .cse11 .cse5 .cse10) (and .cse6 .cse0 .cse2 .cse4 .cse9 .cse5 .cse10) (and .cse14 .cse0 .cse4 .cse15) (and .cse7 .cse8 .cse12) (and .cse7 .cse13 .cse2 .cse8 .cse5) (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 1) (and .cse7 .cse14 .cse2 .cse8 .cse5 .cse16) (and .cse7 .cse1 .cse2 .cse8 .cse5 .cse16) (and .cse7 .cse2 .cse17 .cse8 .cse18 .cse5 .cse16) (and .cse7 .cse14 .cse8 .cse15) (and .cse7 .cse2 .cse8 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse5 .cse16) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse0 .cse2 .cse17 .cse4 .cse18 .cse5 .cse10)))) [2022-07-13 11:25:42,561 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 92) no Hoare annotation was computed. [2022-07-13 11:25:42,561 INFO L902 garLoopResultBuilder]: At program point L613(lines 108 614) the Hoare annotation is: true [2022-07-13 11:25:42,561 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 557) no Hoare annotation was computed. [2022-07-13 11:25:42,561 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 568) no Hoare annotation was computed. [2022-07-13 11:25:42,561 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 579) no Hoare annotation was computed. [2022-07-13 11:25:42,561 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 387) no Hoare annotation was computed. [2022-07-13 11:25:42,561 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 11:25:42,561 INFO L899 garLoopResultBuilder]: For program point L383-2(lines 383 387) no Hoare annotation was computed. [2022-07-13 11:25:42,561 INFO L895 garLoopResultBuilder]: At program point L218(lines 115 580) the Hoare annotation is: (let ((.cse8 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse1 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|)) (.cse5 (not .cse8)) (.cse7 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (.cse2 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse0 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse6 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse9 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|))) (or (and .cse0 (or (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse5 .cse6))) (and .cse1 .cse4 .cse5 .cse7) (and .cse8 .cse4 .cse9 .cse7) (and (or (and .cse8 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse2 .cse3 .cse4 .cse9)) .cse0) (and .cse0 (let ((.cse10 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|))) (or (and .cse8 .cse3 .cse9 .cse6 .cse10) (and .cse8 .cse3 .cse4 .cse9 .cse10))))))) [2022-07-13 11:25:42,561 INFO L895 garLoopResultBuilder]: At program point L185(lines 181 558) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse3 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512))) (or (and .cse0 .cse1 .cse2 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse3 .cse4 .cse5) (and .cse0 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) .cse2 (not .cse1) .cse3 .cse4 .cse5))) [2022-07-13 11:25:42,561 INFO L899 garLoopResultBuilder]: For program point L582(lines 582 610) no Hoare annotation was computed. [2022-07-13 11:25:42,561 INFO L899 garLoopResultBuilder]: For program point L87(lines 87 91) no Hoare annotation was computed. [2022-07-13 11:25:42,561 INFO L899 garLoopResultBuilder]: For program point L87-2(lines 84 92) no Hoare annotation was computed. [2022-07-13 11:25:42,561 INFO L899 garLoopResultBuilder]: For program point L583(lines 583 607) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L517-1(lines 213 545) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 357) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 290) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L319-1(lines 319 333) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 556) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 567) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 578) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L617(lines 617 621) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 593) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L617-2(lines 617 621) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L584-2(lines 583 605) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L895 garLoopResultBuilder]: At program point L155(lines 151 568) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4448)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse4 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 .cse1 .cse2 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse3 .cse4 .cse5) (and .cse0 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) .cse2 .cse3 (not .cse1) .cse4 .cse5))) [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 590) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L454(lines 454 459) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 227) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 555) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 566) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L223-2(lines 213 545) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 577) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L323-2(lines 321 333) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L895 garLoopResultBuilder]: At program point L191(lines 187 556) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528)) (.cse4 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 .cse1 .cse2 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse3 .cse4 .cse5) (and .cse0 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) .cse2 (not .cse1) .cse3 .cse4 .cse5))) [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L522-1(lines 522 526) no Hoare annotation was computed. [2022-07-13 11:25:42,562 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-07-13 11:25:42,563 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 264) no Hoare annotation was computed. [2022-07-13 11:25:42,563 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 554) no Hoare annotation was computed. [2022-07-13 11:25:42,563 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 565) no Hoare annotation was computed. [2022-07-13 11:25:42,563 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 576) no Hoare annotation was computed. [2022-07-13 11:25:42,563 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 102) no Hoare annotation was computed. [2022-07-13 11:25:42,563 INFO L899 garLoopResultBuilder]: For program point L94-1(lines 76 630) no Hoare annotation was computed. [2022-07-13 11:25:42,563 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 11:25:42,563 INFO L895 garLoopResultBuilder]: At program point L161(lines 157 566) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4464)) (.cse4 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) .cse1 (not .cse2) .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse1 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse3 .cse4 .cse5))) [2022-07-13 11:25:42,563 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 99) no Hoare annotation was computed. [2022-07-13 11:25:42,563 INFO L899 garLoopResultBuilder]: For program point L493(lines 493 497) no Hoare annotation was computed. [2022-07-13 11:25:42,565 INFO L899 garLoopResultBuilder]: For program point L493-2(lines 493 497) no Hoare annotation was computed. [2022-07-13 11:25:42,565 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 303) no Hoare annotation was computed. [2022-07-13 11:25:42,565 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 553) no Hoare annotation was computed. [2022-07-13 11:25:42,565 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 564) no Hoare annotation was computed. [2022-07-13 11:25:42,565 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 575) no Hoare annotation was computed. [2022-07-13 11:25:42,565 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2022-07-13 11:25:42,565 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 366) no Hoare annotation was computed. [2022-07-13 11:25:42,565 INFO L895 garLoopResultBuilder]: At program point L197(lines 193 554) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse3 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 .cse1 .cse2 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse3 .cse4) (and .cse0 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|) .cse2 (not .cse1) .cse3 .cse4))) [2022-07-13 11:25:42,565 INFO L895 garLoopResultBuilder]: At program point L131(lines 127 576) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse7 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (.cse1 (< |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4400)) (.cse4 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)) (.cse8 (<= 208 |ULTIMATE.start_ssl3_connect_~ag_Y~0#1|)) (.cse2 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~ag_X~0#1| 4352)) (.cse9 (not .cse0)) (.cse5 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse6 (<= 4352 |ULTIMATE.start_ssl3_connect_~ag_X~0#1|)) (.cse10 (< |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4384))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse4 .cse5 .cse7) (and .cse8 .cse9 .cse5 .cse10 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (and .cse8 .cse2 .cse3 .cse9 .cse5 .cse6 .cse10)))) [2022-07-13 11:25:42,565 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 11:25:42,565 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2022-07-13 11:25:42,565 INFO L895 garLoopResultBuilder]: At program point L363(lines 76 630) the Hoare annotation is: false [2022-07-13 11:25:42,565 INFO L902 garLoopResultBuilder]: At program point L628(lines 76 630) the Hoare annotation is: true [2022-07-13 11:25:42,565 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 601) no Hoare annotation was computed. [2022-07-13 11:25:42,565 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 533) no Hoare annotation was computed. [2022-07-13 11:25:42,565 INFO L899 garLoopResultBuilder]: For program point L529-2(lines 529 533) no Hoare annotation was computed. [2022-07-13 11:25:42,566 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 302) no Hoare annotation was computed. [2022-07-13 11:25:42,566 INFO L899 garLoopResultBuilder]: For program point L298-2(lines 213 545) no Hoare annotation was computed. [2022-07-13 11:25:42,566 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 552) no Hoare annotation was computed. [2022-07-13 11:25:42,566 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 563) no Hoare annotation was computed. [2022-07-13 11:25:42,566 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 574) no Hoare annotation was computed. [2022-07-13 11:25:42,566 INFO L902 garLoopResultBuilder]: At program point L629(lines 18 631) the Hoare annotation is: true [2022-07-13 11:25:42,566 INFO L899 garLoopResultBuilder]: For program point L464(lines 464 468) no Hoare annotation was computed. [2022-07-13 11:25:42,568 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:25:42,569 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:25:42,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:25:42 BoogieIcfgContainer [2022-07-13 11:25:42,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:25:42,617 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:25:42,617 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:25:42,617 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:25:42,618 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:25:26" (3/4) ... [2022-07-13 11:25:42,620 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 11:25:42,637 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-07-13 11:25:42,637 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 11:25:42,638 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 11:25:42,638 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 11:25:42,704 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 11:25:42,704 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:25:42,705 INFO L158 Benchmark]: Toolchain (without parser) took 17184.86ms. Allocated memory was 136.3MB in the beginning and 436.2MB in the end (delta: 299.9MB). Free memory was 101.8MB in the beginning and 215.0MB in the end (delta: -113.1MB). Peak memory consumption was 187.4MB. Max. memory is 16.1GB. [2022-07-13 11:25:42,705 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 81.8MB. Free memory was 54.6MB in the beginning and 54.6MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:25:42,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.02ms. Allocated memory is still 136.3MB. Free memory was 101.6MB in the beginning and 108.8MB in the end (delta: -7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 11:25:42,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.92ms. Allocated memory is still 136.3MB. Free memory was 108.8MB in the beginning and 105.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 11:25:42,705 INFO L158 Benchmark]: Boogie Preprocessor took 33.17ms. Allocated memory is still 136.3MB. Free memory was 105.5MB in the beginning and 103.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:25:42,707 INFO L158 Benchmark]: RCFGBuilder took 531.87ms. Allocated memory is still 136.3MB. Free memory was 103.4MB in the beginning and 71.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-07-13 11:25:42,708 INFO L158 Benchmark]: TraceAbstraction took 16208.23ms. Allocated memory was 136.3MB in the beginning and 436.2MB in the end (delta: 299.9MB). Free memory was 71.9MB in the beginning and 223.4MB in the end (delta: -151.4MB). Peak memory consumption was 225.9MB. Max. memory is 16.1GB. [2022-07-13 11:25:42,708 INFO L158 Benchmark]: Witness Printer took 87.06ms. Allocated memory is still 436.2MB. Free memory was 223.4MB in the beginning and 215.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 11:25:42,713 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.10ms. Allocated memory is still 81.8MB. Free memory was 54.6MB in the beginning and 54.6MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.02ms. Allocated memory is still 136.3MB. Free memory was 101.6MB in the beginning and 108.8MB in the end (delta: -7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.92ms. Allocated memory is still 136.3MB. Free memory was 108.8MB in the beginning and 105.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.17ms. Allocated memory is still 136.3MB. Free memory was 105.5MB in the beginning and 103.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 531.87ms. Allocated memory is still 136.3MB. Free memory was 103.4MB in the beginning and 71.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16208.23ms. Allocated memory was 136.3MB in the beginning and 436.2MB in the end (delta: 299.9MB). Free memory was 71.9MB in the beginning and 223.4MB in the end (delta: -151.4MB). Peak memory consumption was 225.9MB. Max. memory is 16.1GB. * Witness Printer took 87.06ms. Allocated memory is still 436.2MB. Free memory was 223.4MB in the beginning and 215.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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: 624]: 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, 134 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.1s, OverallIterations: 27, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3386 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3386 mSDsluCounter, 8955 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3553 mSDsCounter, 695 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2988 IncrementalHoareTripleChecker+Invalid, 3683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 695 mSolverCounterUnsat, 5402 mSDtfsCounter, 2988 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2178 GetRequests, 2122 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2631occurred in iteration=24, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 1516 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 174 NumberOfFragments, 1294 HoareAnnotationTreeSize, 23 FomulaSimplifications, 27237 FormulaSimplificationTreeSizeReduction, 7.4s HoareSimplificationTime, 23 FomulaSimplificationsInter, 173531 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 5859 NumberOfCodeBlocks, 5859 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 6535 ConstructedInterpolants, 0 QuantifiedInterpolants, 8595 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2442 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 33 InterpolantComputations, 25 PerfectInterpolantSequences, 19517/19606 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: 109]: Loop Invariant Derived loop invariant: (((((((((((((((((((((208 <= ag_Y && 4384 == s__state) && ag_X <= 4352) && blastFlag == 1) && !(s__hit == 0)) && 4352 <= ag_X) || ((((((4432 <= s__state && s__hit == 0) && ag_X <= 4352) && 48 == ag_Z) && s__state <= 4528) && 4352 <= ag_X) && blastFlag <= 4)) || (((((s__hit == 0 && ag_X <= 4352) && 48 == ag_Z) && 4416 == s__state) && 4352 <= ag_X) && blastFlag <= 4)) || ((208 <= ag_Y && !(s__hit == 0)) && 3 == s__state)) || ((((208 <= ag_Y && 2 == blastFlag) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= ag_X)) || (((((s__hit == 0 && 4384 == s__state) && ag_X <= 4352) && blastFlag == 1) && 48 == ag_Z) && 4352 <= ag_X)) || (((((208 <= ag_Y && ag_X <= 4352) && !(s__hit == 0)) && 4416 == s__state) && 4352 <= ag_X) && blastFlag <= 4)) || ((((((4432 <= s__state && 208 <= ag_Y) && ag_X <= 4352) && !(s__hit == 0)) && s__state <= 4528) && 4352 <= ag_X) && blastFlag <= 4)) || (((4368 == s__state && 208 <= ag_Y) && !(s__hit == 0)) && blastFlag == 0)) || ((s__hit == 0 && 48 == ag_Z) && 3 == s__state)) || ((((s__hit == 0 && 2 == blastFlag) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= ag_X)) || s__state == 1) || (((((s__hit == 0 && 4368 == s__state) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= ag_X) && 4560 <= s__s3__tmp__next_state___0)) || (((((s__hit == 0 && 4384 == s__state) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= ag_X) && 4560 <= s__s3__tmp__next_state___0)) || ((((((s__hit == 0 && ag_X <= 4352) && s__state <= 4352) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X) && 4560 <= s__s3__tmp__next_state___0)) || (((s__hit == 0 && 4368 == s__state) && 48 == ag_Z) && blastFlag == 0)) || (((((s__hit == 0 && ag_X <= 4352) && 48 == ag_Z) && 4560 <= s__state) && 4352 <= ag_X) && 4560 <= s__s3__tmp__next_state___0)) || (((((((3 == s__s3__tmp__next_state___0 && 208 <= ag_Y) && ag_X <= 4352) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && 4352 <= ag_X) && blastFlag <= 4) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && s__hit == 0) && s__state <= 4480) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= ag_X) && blastFlag <= 4) || ((((((4432 <= s__state && 208 <= ag_Y) && s__state <= 4480) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= ag_X) && blastFlag <= 4) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((4352 <= ag_X && (((((208 <= ag_Y && 2 == blastFlag) && ag_X <= 4352) && s__state <= 4352) && !(s__hit == 0)) || ((((208 <= ag_Y && 2 == blastFlag) && ag_X <= 4352) && !(s__hit == 0)) && 4560 <= s__state))) || (((208 <= ag_Y && s__state <= 4352) && !(s__hit == 0)) && blastFlag == 0)) || (((s__hit == 0 && s__state <= 4352) && 48 == ag_Z) && blastFlag == 0)) || ((((((s__hit == 0 && 2 == blastFlag) && ag_X <= 4352) && 48 == ag_Z) && 4560 <= s__state) || ((((s__hit == 0 && 2 == blastFlag) && ag_X <= 4352) && s__state <= 4352) && 48 == ag_Z)) && 4352 <= ag_X)) || (4352 <= ag_X && (((((s__hit == 0 && ag_X <= 4352) && 48 == ag_Z) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0) || ((((s__hit == 0 && ag_X <= 4352) && s__state <= 4352) && 48 == ag_Z) && 4560 <= s__s3__tmp__next_state___0))) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && s__hit == 0) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= ag_X) && blastFlag <= 4) && s__state <= 4512) || ((((((4432 <= s__state && 208 <= ag_Y) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= ag_X) && blastFlag <= 4) && s__state <= 4512) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__hit == 0) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= ag_X) && blastFlag <= 4) || (((((4432 <= s__state && 208 <= ag_Y) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= ag_X) && blastFlag <= 4) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((((s__state <= 4432 && 208 <= ag_Y) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && 4352 <= ag_X) && blastFlag <= 4) || ((((((s__hit == 0 && s__state <= 4432) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X) && blastFlag <= 4) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((((((((s__hit == 0 && s__state < 4400) && 2 == blastFlag) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X) || ((((s__hit == 0 && s__state < 4400) && 48 == ag_Z) && 4352 <= s__state) && blastFlag == 0)) || ((((208 <= ag_Y && !(s__hit == 0)) && 4352 <= s__state) && s__state < 4384) && blastFlag == 0)) || ((((((s__hit == 0 && s__state < 4400) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X) && 4560 <= s__s3__tmp__next_state___0)) || ((((((208 <= ag_Y && 2 == blastFlag) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && 4352 <= ag_X) && s__state < 4384) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((((((((s__hit == 0 && 2 == blastFlag) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= ag_X) && 12292 == s__state) || (((s__hit == 0 && 48 == ag_Z) && 12292 == s__state) && blastFlag == 0)) || (((((208 <= ag_Y && 2 == blastFlag) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= ag_X) && 12292 == s__state)) || (((((s__hit == 0 && ag_X <= 4352) && 48 == ag_Z) && 4352 <= ag_X) && 4560 <= s__s3__tmp__next_state___0) && 12292 == s__state)) || (((208 <= ag_Y && !(s__hit == 0)) && 12292 == s__state) && blastFlag == 0) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((208 <= ag_Y && 2 == blastFlag) && ag_X <= 4352) && !(s__hit == 0)) && 4560 <= s__state) && 4352 <= ag_X) || ((4432 <= s__state && s__hit == 0) && 48 == ag_Z) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && 208 <= ag_Y) && ag_X <= 4352) && !(s__hit == 0)) && s__state <= 4464) && 4352 <= ag_X) && blastFlag <= 4) || ((((((4432 <= s__state && s__hit == 0) && ag_X <= 4352) && 48 == ag_Z) && s__state <= 4464) && 4352 <= ag_X) && blastFlag <= 4) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (((((((((s__state < 4400 && 208 <= ag_Y) && 2 == blastFlag) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && 4352 <= ag_X) || ((((((s__hit == 0 && s__state < 4400) && 2 == blastFlag) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X)) || ((((((s__state < 4400 && 208 <= ag_Y) && ag_X <= 4352) && blastFlag == 1) && !(s__hit == 0)) && 4352 <= s__state) && 4352 <= ag_X)) || ((((((s__hit == 0 && s__state < 4400) && ag_X <= 4352) && blastFlag == 1) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X)) || ((((((s__hit == 0 && s__state < 4400) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X) && 4560 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && s__hit == 0) && ag_X <= 4352) && 48 == ag_Z) && s__state <= 4528) && 4352 <= ag_X) && blastFlag <= 4) || ((((((4432 <= s__state && 208 <= ag_Y) && ag_X <= 4352) && !(s__hit == 0)) && s__state <= 4528) && 4352 <= ag_X) && blastFlag <= 4) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && s__hit == 0) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= ag_X) && blastFlag <= 4) && s__state <= 4512) || ((((((4432 <= s__state && 208 <= ag_Y) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= ag_X) && blastFlag <= 4) && s__state <= 4512) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: ((((((s__hit == 0 && s__state <= 4432) && 2 == blastFlag) && ag_X <= 4352) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X) || ((((((s__state <= 4432 && 208 <= ag_Y) && 2 == blastFlag) && ag_X <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && 4352 <= ag_X) - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: ((((((4432 <= s__state && s__hit == 0) && ag_X <= 4352) && 48 == ag_Z) && s__state <= 4448) && 4352 <= ag_X) && blastFlag <= 4) || ((((((4432 <= s__state && 208 <= ag_Y) && ag_X <= 4352) && s__state <= 4448) && !(s__hit == 0)) && 4352 <= ag_X) && blastFlag <= 4) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: ((((((((s__hit == 0 && 2 == blastFlag) && ag_X <= 4352) && s__state <= 4352) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X) || ((((((208 <= ag_Y && 2 == blastFlag) && ag_X <= 4352) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && 4352 <= ag_X)) || ((((((s__hit == 0 && ag_X <= 4352) && s__state <= 4352) && 48 == ag_Z) && 4352 <= s__state) && 4352 <= ag_X) && 4560 <= s__s3__tmp__next_state___0)) || (((((((3 == s__s3__tmp__next_state___0 && 208 <= ag_Y) && ag_X <= 4352) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && 4352 <= ag_X) && blastFlag <= 4) RESULT: Ultimate proved your program to be correct! [2022-07-13 11:25:42,760 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