./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c 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/locks/test_locks_11.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 dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 00:23:26,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 00:23:26,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 00:23:26,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 00:23:26,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 00:23:26,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 00:23:26,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 00:23:26,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 00:23:26,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 00:23:26,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 00:23:26,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 00:23:26,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 00:23:26,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 00:23:26,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 00:23:26,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 00:23:26,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 00:23:26,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 00:23:26,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 00:23:26,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 00:23:26,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 00:23:26,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 00:23:26,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 00:23:26,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 00:23:26,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 00:23:27,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 00:23:27,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 00:23:27,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 00:23:27,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 00:23:27,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 00:23:27,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 00:23:27,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 00:23:27,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 00:23:27,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 00:23:27,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 00:23:27,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 00:23:27,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 00:23:27,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 00:23:27,020 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 00:23:27,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 00:23:27,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 00:23:27,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 00:23:27,023 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 00:23:27,054 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 00:23:27,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 00:23:27,059 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 00:23:27,059 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 00:23:27,060 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 00:23:27,060 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 00:23:27,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 00:23:27,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 00:23:27,062 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 00:23:27,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 00:23:27,063 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 00:23:27,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 00:23:27,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 00:23:27,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 00:23:27,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 00:23:27,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 00:23:27,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 00:23:27,064 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 00:23:27,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 00:23:27,065 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 00:23:27,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 00:23:27,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 00:23:27,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 00:23:27,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 00:23:27,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 00:23:27,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 00:23:27,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 00:23:27,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 00:23:27,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 00:23:27,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 00:23:27,067 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 00:23:27,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 00:23:27,067 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 00:23:27,067 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 00:23:27,067 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 00:23:27,068 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2023-02-17 00:23:27,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 00:23:27,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 00:23:27,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 00:23:27,337 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 00:23:27,337 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 00:23:27,338 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2023-02-17 00:23:28,508 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 00:23:28,671 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 00:23:28,671 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2023-02-17 00:23:28,680 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e865aa3/2b7bedf6b16a40209f093e9b54605592/FLAG668fdb767 [2023-02-17 00:23:28,699 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e865aa3/2b7bedf6b16a40209f093e9b54605592 [2023-02-17 00:23:28,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 00:23:28,704 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 00:23:28,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 00:23:28,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 00:23:28,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 00:23:28,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 12:23:28" (1/1) ... [2023-02-17 00:23:28,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309e3146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:28, skipping insertion in model container [2023-02-17 00:23:28,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 12:23:28" (1/1) ... [2023-02-17 00:23:28,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 00:23:28,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 00:23:28,899 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2023-02-17 00:23:28,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 00:23:28,910 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 00:23:28,936 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2023-02-17 00:23:28,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 00:23:28,948 INFO L208 MainTranslator]: Completed translation [2023-02-17 00:23:28,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:28 WrapperNode [2023-02-17 00:23:28,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 00:23:28,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 00:23:28,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 00:23:28,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 00:23:28,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:28" (1/1) ... [2023-02-17 00:23:28,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:28" (1/1) ... [2023-02-17 00:23:28,977 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 149 [2023-02-17 00:23:28,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 00:23:28,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 00:23:28,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 00:23:28,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 00:23:28,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:28" (1/1) ... [2023-02-17 00:23:28,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:28" (1/1) ... [2023-02-17 00:23:28,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:28" (1/1) ... [2023-02-17 00:23:28,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:28" (1/1) ... [2023-02-17 00:23:28,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:28" (1/1) ... [2023-02-17 00:23:28,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:28" (1/1) ... [2023-02-17 00:23:28,997 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:28" (1/1) ... [2023-02-17 00:23:28,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:28" (1/1) ... [2023-02-17 00:23:29,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 00:23:29,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 00:23:29,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 00:23:29,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 00:23:29,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:28" (1/1) ... [2023-02-17 00:23:29,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 00:23:29,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:23:29,029 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) [2023-02-17 00:23:29,044 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 [2023-02-17 00:23:29,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 00:23:29,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 00:23:29,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 00:23:29,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 00:23:29,137 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 00:23:29,141 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 00:23:29,413 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 00:23:29,418 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 00:23:29,418 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 00:23:29,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:23:29 BoogieIcfgContainer [2023-02-17 00:23:29,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 00:23:29,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 00:23:29,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 00:23:29,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 00:23:29,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 12:23:28" (1/3) ... [2023-02-17 00:23:29,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de3d84f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 12:23:29, skipping insertion in model container [2023-02-17 00:23:29,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:28" (2/3) ... [2023-02-17 00:23:29,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de3d84f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 12:23:29, skipping insertion in model container [2023-02-17 00:23:29,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:23:29" (3/3) ... [2023-02-17 00:23:29,426 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2023-02-17 00:23:29,441 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 00:23:29,441 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 00:23:29,490 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 00:23:29,495 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@fd9a911, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 00:23:29,495 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 00:23:29,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:29,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 00:23:29,513 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:29,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:29,514 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:29,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:29,523 INFO L85 PathProgramCache]: Analyzing trace with hash 458919617, now seen corresponding path program 1 times [2023-02-17 00:23:29,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:29,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909019178] [2023-02-17 00:23:29,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:29,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:29,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:29,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909019178] [2023-02-17 00:23:29,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909019178] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:29,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:29,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:29,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855618764] [2023-02-17 00:23:29,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:29,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:29,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:29,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:29,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:29,773 INFO L87 Difference]: Start difference. First operand has 43 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 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 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:29,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:29,816 INFO L93 Difference]: Finished difference Result 89 states and 157 transitions. [2023-02-17 00:23:29,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:29,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2023-02-17 00:23:29,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:29,825 INFO L225 Difference]: With dead ends: 89 [2023-02-17 00:23:29,826 INFO L226 Difference]: Without dead ends: 75 [2023-02-17 00:23:29,828 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 [2023-02-17 00:23:29,836 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:29,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:29,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-17 00:23:29,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 51. [2023-02-17 00:23:29,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.88) internal successors, (94), 50 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 94 transitions. [2023-02-17 00:23:29,891 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 94 transitions. Word has length 18 [2023-02-17 00:23:29,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:29,892 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 94 transitions. [2023-02-17 00:23:29,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 94 transitions. [2023-02-17 00:23:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 00:23:29,894 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:29,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:29,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 00:23:29,895 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:29,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:29,898 INFO L85 PathProgramCache]: Analyzing trace with hash -552197633, now seen corresponding path program 1 times [2023-02-17 00:23:29,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:29,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924271172] [2023-02-17 00:23:29,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:29,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:30,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:30,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:30,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924271172] [2023-02-17 00:23:30,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924271172] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:30,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:30,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:30,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479503500] [2023-02-17 00:23:30,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:30,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:30,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:30,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:30,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:30,011 INFO L87 Difference]: Start difference. First operand 51 states and 94 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:30,053 INFO L93 Difference]: Finished difference Result 124 states and 229 transitions. [2023-02-17 00:23:30,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:30,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2023-02-17 00:23:30,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:30,055 INFO L225 Difference]: With dead ends: 124 [2023-02-17 00:23:30,056 INFO L226 Difference]: Without dead ends: 75 [2023-02-17 00:23:30,056 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 [2023-02-17 00:23:30,057 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:30,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 157 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:30,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-17 00:23:30,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2023-02-17 00:23:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 134 transitions. [2023-02-17 00:23:30,070 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 134 transitions. Word has length 18 [2023-02-17 00:23:30,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:30,071 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 134 transitions. [2023-02-17 00:23:30,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,072 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 134 transitions. [2023-02-17 00:23:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 00:23:30,075 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:30,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:30,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 00:23:30,076 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:30,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:30,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1341819263, now seen corresponding path program 1 times [2023-02-17 00:23:30,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:30,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943152693] [2023-02-17 00:23:30,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:30,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:30,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:30,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943152693] [2023-02-17 00:23:30,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943152693] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:30,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:30,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:30,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548155781] [2023-02-17 00:23:30,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:30,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:30,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:30,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:30,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:30,158 INFO L87 Difference]: Start difference. First operand 73 states and 134 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:30,187 INFO L93 Difference]: Finished difference Result 114 states and 204 transitions. [2023-02-17 00:23:30,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:30,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2023-02-17 00:23:30,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:30,189 INFO L225 Difference]: With dead ends: 114 [2023-02-17 00:23:30,189 INFO L226 Difference]: Without dead ends: 78 [2023-02-17 00:23:30,189 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 [2023-02-17 00:23:30,191 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 55 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:30,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:30,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-17 00:23:30,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2023-02-17 00:23:30,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 75 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 136 transitions. [2023-02-17 00:23:30,198 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 136 transitions. Word has length 19 [2023-02-17 00:23:30,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:30,199 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 136 transitions. [2023-02-17 00:23:30,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,199 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 136 transitions. [2023-02-17 00:23:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 00:23:30,200 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:30,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:30,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 00:23:30,200 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:30,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:30,201 INFO L85 PathProgramCache]: Analyzing trace with hash 61955585, now seen corresponding path program 1 times [2023-02-17 00:23:30,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:30,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965827750] [2023-02-17 00:23:30,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:30,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:30,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:30,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:30,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965827750] [2023-02-17 00:23:30,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965827750] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:30,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:30,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:30,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963540678] [2023-02-17 00:23:30,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:30,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:30,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:30,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:30,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:30,236 INFO L87 Difference]: Start difference. First operand 76 states and 136 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:30,248 INFO L93 Difference]: Finished difference Result 145 states and 261 transitions. [2023-02-17 00:23:30,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:30,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2023-02-17 00:23:30,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:30,249 INFO L225 Difference]: With dead ends: 145 [2023-02-17 00:23:30,250 INFO L226 Difference]: Without dead ends: 143 [2023-02-17 00:23:30,250 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 [2023-02-17 00:23:30,251 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 50 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:30,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:30,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-02-17 00:23:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101. [2023-02-17 00:23:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.81) internal successors, (181), 100 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 181 transitions. [2023-02-17 00:23:30,259 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 181 transitions. Word has length 19 [2023-02-17 00:23:30,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:30,260 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 181 transitions. [2023-02-17 00:23:30,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,260 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 181 transitions. [2023-02-17 00:23:30,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 00:23:30,261 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:30,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:30,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 00:23:30,261 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:30,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:30,262 INFO L85 PathProgramCache]: Analyzing trace with hash -949161665, now seen corresponding path program 1 times [2023-02-17 00:23:30,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:30,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413000956] [2023-02-17 00:23:30,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:30,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:30,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:30,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413000956] [2023-02-17 00:23:30,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413000956] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:30,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:30,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:30,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842475744] [2023-02-17 00:23:30,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:30,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:30,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:30,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:30,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:30,306 INFO L87 Difference]: Start difference. First operand 101 states and 181 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:30,324 INFO L93 Difference]: Finished difference Result 241 states and 435 transitions. [2023-02-17 00:23:30,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:30,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2023-02-17 00:23:30,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:30,325 INFO L225 Difference]: With dead ends: 241 [2023-02-17 00:23:30,330 INFO L226 Difference]: Without dead ends: 145 [2023-02-17 00:23:30,331 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 [2023-02-17 00:23:30,332 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:30,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 158 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-17 00:23:30,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2023-02-17 00:23:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.795774647887324) internal successors, (255), 142 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 255 transitions. [2023-02-17 00:23:30,341 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 255 transitions. Word has length 19 [2023-02-17 00:23:30,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:30,342 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 255 transitions. [2023-02-17 00:23:30,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,342 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 255 transitions. [2023-02-17 00:23:30,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 00:23:30,343 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:30,343 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] [2023-02-17 00:23:30,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 00:23:30,343 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:30,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:30,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1920836500, now seen corresponding path program 1 times [2023-02-17 00:23:30,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:30,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110674049] [2023-02-17 00:23:30,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:30,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:30,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:30,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110674049] [2023-02-17 00:23:30,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110674049] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:30,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:30,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:30,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834797846] [2023-02-17 00:23:30,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:30,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:30,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:30,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:30,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:30,375 INFO L87 Difference]: Start difference. First operand 143 states and 255 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:30,386 INFO L93 Difference]: Finished difference Result 216 states and 382 transitions. [2023-02-17 00:23:30,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:30,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2023-02-17 00:23:30,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:30,388 INFO L225 Difference]: With dead ends: 216 [2023-02-17 00:23:30,388 INFO L226 Difference]: Without dead ends: 147 [2023-02-17 00:23:30,388 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 [2023-02-17 00:23:30,389 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 54 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:30,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:30,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-02-17 00:23:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2023-02-17 00:23:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 144 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 255 transitions. [2023-02-17 00:23:30,398 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 255 transitions. Word has length 20 [2023-02-17 00:23:30,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:30,398 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 255 transitions. [2023-02-17 00:23:30,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 255 transitions. [2023-02-17 00:23:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 00:23:30,399 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:30,399 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] [2023-02-17 00:23:30,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-17 00:23:30,400 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:30,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:30,400 INFO L85 PathProgramCache]: Analyzing trace with hash 640972822, now seen corresponding path program 1 times [2023-02-17 00:23:30,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:30,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354213652] [2023-02-17 00:23:30,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:30,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:30,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:30,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354213652] [2023-02-17 00:23:30,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354213652] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:30,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:30,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:30,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705206545] [2023-02-17 00:23:30,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:30,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:30,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:30,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:30,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:30,429 INFO L87 Difference]: Start difference. First operand 145 states and 255 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:30,441 INFO L93 Difference]: Finished difference Result 417 states and 737 transitions. [2023-02-17 00:23:30,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:30,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2023-02-17 00:23:30,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:30,443 INFO L225 Difference]: With dead ends: 417 [2023-02-17 00:23:30,443 INFO L226 Difference]: Without dead ends: 279 [2023-02-17 00:23:30,444 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 [2023-02-17 00:23:30,445 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:30,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 139 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:30,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-02-17 00:23:30,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2023-02-17 00:23:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.75) internal successors, (483), 276 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 483 transitions. [2023-02-17 00:23:30,457 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 483 transitions. Word has length 20 [2023-02-17 00:23:30,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:30,458 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 483 transitions. [2023-02-17 00:23:30,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,458 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 483 transitions. [2023-02-17 00:23:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 00:23:30,459 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:30,459 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] [2023-02-17 00:23:30,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 00:23:30,460 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:30,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:30,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1652090072, now seen corresponding path program 1 times [2023-02-17 00:23:30,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:30,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062707542] [2023-02-17 00:23:30,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:30,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:30,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:30,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062707542] [2023-02-17 00:23:30,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062707542] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:30,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:30,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:30,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985432265] [2023-02-17 00:23:30,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:30,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:30,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:30,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:30,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:30,503 INFO L87 Difference]: Start difference. First operand 277 states and 483 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:30,519 INFO L93 Difference]: Finished difference Result 353 states and 621 transitions. [2023-02-17 00:23:30,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:30,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2023-02-17 00:23:30,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:30,523 INFO L225 Difference]: With dead ends: 353 [2023-02-17 00:23:30,523 INFO L226 Difference]: Without dead ends: 351 [2023-02-17 00:23:30,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:30,525 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 47 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:30,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 188 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:30,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-02-17 00:23:30,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 277. [2023-02-17 00:23:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.7355072463768115) internal successors, (479), 276 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 479 transitions. [2023-02-17 00:23:30,550 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 479 transitions. Word has length 20 [2023-02-17 00:23:30,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:30,551 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 479 transitions. [2023-02-17 00:23:30,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 479 transitions. [2023-02-17 00:23:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 00:23:30,555 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:30,557 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] [2023-02-17 00:23:30,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-17 00:23:30,558 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:30,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:30,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1604465292, now seen corresponding path program 1 times [2023-02-17 00:23:30,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:30,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706383989] [2023-02-17 00:23:30,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:30,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:30,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:30,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706383989] [2023-02-17 00:23:30,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706383989] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:30,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:30,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:30,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106001081] [2023-02-17 00:23:30,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:30,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:30,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:30,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:30,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:30,584 INFO L87 Difference]: Start difference. First operand 277 states and 479 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:30,597 INFO L93 Difference]: Finished difference Result 517 states and 905 transitions. [2023-02-17 00:23:30,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:30,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2023-02-17 00:23:30,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:30,600 INFO L225 Difference]: With dead ends: 517 [2023-02-17 00:23:30,601 INFO L226 Difference]: Without dead ends: 515 [2023-02-17 00:23:30,601 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 [2023-02-17 00:23:30,602 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 44 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:30,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:30,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2023-02-17 00:23:30,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 385. [2023-02-17 00:23:30,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.7057291666666667) internal successors, (655), 384 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 655 transitions. [2023-02-17 00:23:30,614 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 655 transitions. Word has length 21 [2023-02-17 00:23:30,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:30,615 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 655 transitions. [2023-02-17 00:23:30,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,615 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 655 transitions. [2023-02-17 00:23:30,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 00:23:30,616 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:30,616 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] [2023-02-17 00:23:30,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-17 00:23:30,617 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:30,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:30,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1679384754, now seen corresponding path program 1 times [2023-02-17 00:23:30,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:30,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235804018] [2023-02-17 00:23:30,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:30,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:30,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:30,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235804018] [2023-02-17 00:23:30,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235804018] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:30,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:30,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:30,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244473653] [2023-02-17 00:23:30,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:30,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:30,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:30,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:30,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:30,640 INFO L87 Difference]: Start difference. First operand 385 states and 655 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:30,663 INFO L93 Difference]: Finished difference Result 917 states and 1569 transitions. [2023-02-17 00:23:30,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:30,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2023-02-17 00:23:30,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:30,665 INFO L225 Difference]: With dead ends: 917 [2023-02-17 00:23:30,665 INFO L226 Difference]: Without dead ends: 539 [2023-02-17 00:23:30,668 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 [2023-02-17 00:23:30,669 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:30,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 160 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:30,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2023-02-17 00:23:30,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 537. [2023-02-17 00:23:30,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.6921641791044777) internal successors, (907), 536 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 907 transitions. [2023-02-17 00:23:30,688 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 907 transitions. Word has length 21 [2023-02-17 00:23:30,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:30,688 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 907 transitions. [2023-02-17 00:23:30,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,689 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 907 transitions. [2023-02-17 00:23:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 00:23:30,692 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:30,692 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] [2023-02-17 00:23:30,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-17 00:23:30,693 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:30,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:30,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1801397547, now seen corresponding path program 1 times [2023-02-17 00:23:30,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:30,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806632739] [2023-02-17 00:23:30,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:30,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:30,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:30,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806632739] [2023-02-17 00:23:30,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806632739] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:30,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:30,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:30,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253620310] [2023-02-17 00:23:30,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:30,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:30,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:30,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:30,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:30,743 INFO L87 Difference]: Start difference. First operand 537 states and 907 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:30,763 INFO L93 Difference]: Finished difference Result 813 states and 1369 transitions. [2023-02-17 00:23:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:30,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2023-02-17 00:23:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:30,766 INFO L225 Difference]: With dead ends: 813 [2023-02-17 00:23:30,766 INFO L226 Difference]: Without dead ends: 551 [2023-02-17 00:23:30,769 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 [2023-02-17 00:23:30,770 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 52 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:30,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:30,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2023-02-17 00:23:30,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549. [2023-02-17 00:23:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 915 transitions. [2023-02-17 00:23:30,785 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 915 transitions. Word has length 22 [2023-02-17 00:23:30,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:30,785 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 915 transitions. [2023-02-17 00:23:30,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 915 transitions. [2023-02-17 00:23:30,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 00:23:30,787 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:30,787 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] [2023-02-17 00:23:30,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-17 00:23:30,788 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:30,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:30,789 INFO L85 PathProgramCache]: Analyzing trace with hash 521533869, now seen corresponding path program 1 times [2023-02-17 00:23:30,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:30,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435273793] [2023-02-17 00:23:30,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:30,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:30,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:30,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:30,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435273793] [2023-02-17 00:23:30,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435273793] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:30,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:30,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:30,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541364319] [2023-02-17 00:23:30,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:30,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:30,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:30,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:30,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:30,833 INFO L87 Difference]: Start difference. First operand 549 states and 915 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:30,854 INFO L93 Difference]: Finished difference Result 1001 states and 1693 transitions. [2023-02-17 00:23:30,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:30,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2023-02-17 00:23:30,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:30,857 INFO L225 Difference]: With dead ends: 1001 [2023-02-17 00:23:30,858 INFO L226 Difference]: Without dead ends: 999 [2023-02-17 00:23:30,858 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 [2023-02-17 00:23:30,859 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 41 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:30,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2023-02-17 00:23:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 773. [2023-02-17 00:23:30,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1259 transitions. [2023-02-17 00:23:30,879 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1259 transitions. Word has length 22 [2023-02-17 00:23:30,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:30,879 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1259 transitions. [2023-02-17 00:23:30,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1259 transitions. [2023-02-17 00:23:30,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 00:23:30,881 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:30,881 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] [2023-02-17 00:23:30,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-17 00:23:30,882 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:30,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:30,883 INFO L85 PathProgramCache]: Analyzing trace with hash -489583381, now seen corresponding path program 1 times [2023-02-17 00:23:30,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:30,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541582995] [2023-02-17 00:23:30,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:30,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:30,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:30,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541582995] [2023-02-17 00:23:30,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541582995] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:30,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:30,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:30,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975144435] [2023-02-17 00:23:30,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:30,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:30,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:30,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:30,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:30,922 INFO L87 Difference]: Start difference. First operand 773 states and 1259 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:30,949 INFO L93 Difference]: Finished difference Result 1817 states and 2973 transitions. [2023-02-17 00:23:30,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:30,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2023-02-17 00:23:30,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:30,953 INFO L225 Difference]: With dead ends: 1817 [2023-02-17 00:23:30,953 INFO L226 Difference]: Without dead ends: 1063 [2023-02-17 00:23:30,954 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 [2023-02-17 00:23:30,955 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:30,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 161 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2023-02-17 00:23:30,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1061. [2023-02-17 00:23:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1715 transitions. [2023-02-17 00:23:30,982 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1715 transitions. Word has length 22 [2023-02-17 00:23:30,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:30,983 INFO L495 AbstractCegarLoop]: Abstraction has 1061 states and 1715 transitions. [2023-02-17 00:23:30,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1715 transitions. [2023-02-17 00:23:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-17 00:23:30,984 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:30,984 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] [2023-02-17 00:23:30,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-17 00:23:30,985 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:30,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:30,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1012104857, now seen corresponding path program 1 times [2023-02-17 00:23:30,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:30,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364127398] [2023-02-17 00:23:30,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:30,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:31,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:31,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364127398] [2023-02-17 00:23:31,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364127398] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:31,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:31,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:31,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945589575] [2023-02-17 00:23:31,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:31,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:31,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:31,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:31,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:31,020 INFO L87 Difference]: Start difference. First operand 1061 states and 1715 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:31,049 INFO L93 Difference]: Finished difference Result 1593 states and 2565 transitions. [2023-02-17 00:23:31,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:31,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2023-02-17 00:23:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:31,053 INFO L225 Difference]: With dead ends: 1593 [2023-02-17 00:23:31,053 INFO L226 Difference]: Without dead ends: 1079 [2023-02-17 00:23:31,054 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 [2023-02-17 00:23:31,054 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 51 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:31,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:31,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2023-02-17 00:23:31,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1077. [2023-02-17 00:23:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1715 transitions. [2023-02-17 00:23:31,080 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1715 transitions. Word has length 23 [2023-02-17 00:23:31,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:31,081 INFO L495 AbstractCegarLoop]: Abstraction has 1077 states and 1715 transitions. [2023-02-17 00:23:31,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1715 transitions. [2023-02-17 00:23:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-17 00:23:31,083 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:31,083 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] [2023-02-17 00:23:31,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-17 00:23:31,083 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:31,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:31,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2002998761, now seen corresponding path program 1 times [2023-02-17 00:23:31,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:31,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493827976] [2023-02-17 00:23:31,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:31,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:31,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:31,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493827976] [2023-02-17 00:23:31,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493827976] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:31,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:31,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:31,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014061376] [2023-02-17 00:23:31,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:31,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:31,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:31,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:31,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:31,109 INFO L87 Difference]: Start difference. First operand 1077 states and 1715 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:31,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:31,139 INFO L93 Difference]: Finished difference Result 1929 states and 3125 transitions. [2023-02-17 00:23:31,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:31,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2023-02-17 00:23:31,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:31,145 INFO L225 Difference]: With dead ends: 1929 [2023-02-17 00:23:31,146 INFO L226 Difference]: Without dead ends: 1927 [2023-02-17 00:23:31,146 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 [2023-02-17 00:23:31,147 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 38 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:31,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 129 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2023-02-17 00:23:31,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1541. [2023-02-17 00:23:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2387 transitions. [2023-02-17 00:23:31,183 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2387 transitions. Word has length 23 [2023-02-17 00:23:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:31,184 INFO L495 AbstractCegarLoop]: Abstraction has 1541 states and 2387 transitions. [2023-02-17 00:23:31,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2387 transitions. [2023-02-17 00:23:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-17 00:23:31,186 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:31,186 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] [2023-02-17 00:23:31,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-17 00:23:31,186 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:31,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:31,187 INFO L85 PathProgramCache]: Analyzing trace with hash 991881511, now seen corresponding path program 1 times [2023-02-17 00:23:31,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:31,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809841403] [2023-02-17 00:23:31,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:31,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:31,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:31,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809841403] [2023-02-17 00:23:31,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809841403] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:31,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:31,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:31,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242613097] [2023-02-17 00:23:31,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:31,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:31,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:31,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:31,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:31,204 INFO L87 Difference]: Start difference. First operand 1541 states and 2387 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:31,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:31,255 INFO L93 Difference]: Finished difference Result 3593 states and 5589 transitions. [2023-02-17 00:23:31,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:31,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2023-02-17 00:23:31,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:31,262 INFO L225 Difference]: With dead ends: 3593 [2023-02-17 00:23:31,262 INFO L226 Difference]: Without dead ends: 2087 [2023-02-17 00:23:31,264 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 [2023-02-17 00:23:31,264 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:31,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2023-02-17 00:23:31,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 2085. [2023-02-17 00:23:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:31,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 3203 transitions. [2023-02-17 00:23:31,327 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 3203 transitions. Word has length 23 [2023-02-17 00:23:31,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:31,327 INFO L495 AbstractCegarLoop]: Abstraction has 2085 states and 3203 transitions. [2023-02-17 00:23:31,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:31,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 3203 transitions. [2023-02-17 00:23:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 00:23:31,329 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:31,330 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] [2023-02-17 00:23:31,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-17 00:23:31,330 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:31,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:31,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1963634176, now seen corresponding path program 1 times [2023-02-17 00:23:31,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:31,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468792755] [2023-02-17 00:23:31,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:31,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:31,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:31,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468792755] [2023-02-17 00:23:31,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468792755] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:31,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:31,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:31,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472066326] [2023-02-17 00:23:31,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:31,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:31,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:31,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:31,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:31,354 INFO L87 Difference]: Start difference. First operand 2085 states and 3203 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:31,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:31,392 INFO L93 Difference]: Finished difference Result 3129 states and 4789 transitions. [2023-02-17 00:23:31,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:31,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2023-02-17 00:23:31,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:31,399 INFO L225 Difference]: With dead ends: 3129 [2023-02-17 00:23:31,399 INFO L226 Difference]: Without dead ends: 2119 [2023-02-17 00:23:31,402 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 [2023-02-17 00:23:31,403 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:31,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:31,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2023-02-17 00:23:31,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2117. [2023-02-17 00:23:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3203 transitions. [2023-02-17 00:23:31,467 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3203 transitions. Word has length 24 [2023-02-17 00:23:31,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:31,467 INFO L495 AbstractCegarLoop]: Abstraction has 2117 states and 3203 transitions. [2023-02-17 00:23:31,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3203 transitions. [2023-02-17 00:23:31,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 00:23:31,469 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:31,470 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] [2023-02-17 00:23:31,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-17 00:23:31,470 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:31,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:31,471 INFO L85 PathProgramCache]: Analyzing trace with hash 683770498, now seen corresponding path program 1 times [2023-02-17 00:23:31,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:31,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393943446] [2023-02-17 00:23:31,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:31,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:31,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:31,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393943446] [2023-02-17 00:23:31,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393943446] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:31,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:31,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:31,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693790077] [2023-02-17 00:23:31,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:31,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:31,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:31,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:31,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:31,489 INFO L87 Difference]: Start difference. First operand 2117 states and 3203 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:31,554 INFO L93 Difference]: Finished difference Result 3721 states and 5733 transitions. [2023-02-17 00:23:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:31,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2023-02-17 00:23:31,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:31,566 INFO L225 Difference]: With dead ends: 3721 [2023-02-17 00:23:31,566 INFO L226 Difference]: Without dead ends: 3719 [2023-02-17 00:23:31,567 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 [2023-02-17 00:23:31,567 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:31,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 127 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:31,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2023-02-17 00:23:31,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3077. [2023-02-17 00:23:31,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4515 transitions. [2023-02-17 00:23:31,648 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4515 transitions. Word has length 24 [2023-02-17 00:23:31,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:31,648 INFO L495 AbstractCegarLoop]: Abstraction has 3077 states and 4515 transitions. [2023-02-17 00:23:31,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:31,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4515 transitions. [2023-02-17 00:23:31,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 00:23:31,651 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:31,652 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] [2023-02-17 00:23:31,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-17 00:23:31,652 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:31,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:31,653 INFO L85 PathProgramCache]: Analyzing trace with hash -327346752, now seen corresponding path program 1 times [2023-02-17 00:23:31,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:31,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067827569] [2023-02-17 00:23:31,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:31,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:31,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:31,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067827569] [2023-02-17 00:23:31,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067827569] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:31,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:31,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:31,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017073633] [2023-02-17 00:23:31,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:31,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:31,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:31,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:31,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:31,684 INFO L87 Difference]: Start difference. First operand 3077 states and 4515 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:31,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:31,757 INFO L93 Difference]: Finished difference Result 7113 states and 10469 transitions. [2023-02-17 00:23:31,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:31,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2023-02-17 00:23:31,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:31,782 INFO L225 Difference]: With dead ends: 7113 [2023-02-17 00:23:31,783 INFO L226 Difference]: Without dead ends: 4103 [2023-02-17 00:23:31,785 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 [2023-02-17 00:23:31,786 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 47 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:31,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2023-02-17 00:23:31,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 4101. [2023-02-17 00:23:31,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:31,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5955 transitions. [2023-02-17 00:23:31,889 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5955 transitions. Word has length 24 [2023-02-17 00:23:31,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:31,889 INFO L495 AbstractCegarLoop]: Abstraction has 4101 states and 5955 transitions. [2023-02-17 00:23:31,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:31,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5955 transitions. [2023-02-17 00:23:31,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 00:23:31,893 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:31,893 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] [2023-02-17 00:23:31,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-17 00:23:31,894 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:31,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:31,894 INFO L85 PathProgramCache]: Analyzing trace with hash -277735972, now seen corresponding path program 1 times [2023-02-17 00:23:31,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:31,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838167757] [2023-02-17 00:23:31,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:31,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:31,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:31,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838167757] [2023-02-17 00:23:31,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838167757] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:31,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:31,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:31,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775009244] [2023-02-17 00:23:31,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:31,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:31,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:31,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:31,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:31,911 INFO L87 Difference]: Start difference. First operand 4101 states and 5955 transitions. 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) [2023-02-17 00:23:31,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:31,983 INFO L93 Difference]: Finished difference Result 6153 states and 8901 transitions. [2023-02-17 00:23:31,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:31,984 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 [2023-02-17 00:23:31,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:32,010 INFO L225 Difference]: With dead ends: 6153 [2023-02-17 00:23:32,010 INFO L226 Difference]: Without dead ends: 4167 [2023-02-17 00:23:32,013 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 [2023-02-17 00:23:32,014 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 49 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:32,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 152 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:32,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4167 states. [2023-02-17 00:23:32,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4167 to 4165. [2023-02-17 00:23:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4165 states to 4165 states and 5955 transitions. [2023-02-17 00:23:32,114 INFO L78 Accepts]: Start accepts. Automaton has 4165 states and 5955 transitions. Word has length 25 [2023-02-17 00:23:32,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:32,114 INFO L495 AbstractCegarLoop]: Abstraction has 4165 states and 5955 transitions. [2023-02-17 00:23:32,114 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) [2023-02-17 00:23:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4165 states and 5955 transitions. [2023-02-17 00:23:32,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 00:23:32,120 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:32,120 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] [2023-02-17 00:23:32,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-17 00:23:32,120 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:32,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:32,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1557599650, now seen corresponding path program 1 times [2023-02-17 00:23:32,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:32,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595115003] [2023-02-17 00:23:32,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:32,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:32,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:32,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595115003] [2023-02-17 00:23:32,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595115003] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:32,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:32,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:32,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010034279] [2023-02-17 00:23:32,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:32,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:32,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:32,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:32,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:32,140 INFO L87 Difference]: Start difference. First operand 4165 states and 5955 transitions. 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) [2023-02-17 00:23:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:32,254 INFO L93 Difference]: Finished difference Result 7177 states and 10437 transitions. [2023-02-17 00:23:32,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:32,254 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 [2023-02-17 00:23:32,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:32,265 INFO L225 Difference]: With dead ends: 7177 [2023-02-17 00:23:32,266 INFO L226 Difference]: Without dead ends: 7175 [2023-02-17 00:23:32,267 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 [2023-02-17 00:23:32,267 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 32 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:32,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 125 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:32,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7175 states. [2023-02-17 00:23:32,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7175 to 6149. [2023-02-17 00:23:32,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 8515 transitions. [2023-02-17 00:23:32,413 INFO L78 Accepts]: Start accepts. Automaton has 6149 states and 8515 transitions. Word has length 25 [2023-02-17 00:23:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:32,413 INFO L495 AbstractCegarLoop]: Abstraction has 6149 states and 8515 transitions. [2023-02-17 00:23:32,413 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) [2023-02-17 00:23:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 6149 states and 8515 transitions. [2023-02-17 00:23:32,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 00:23:32,420 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:32,420 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] [2023-02-17 00:23:32,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-17 00:23:32,420 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:32,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:32,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1726250396, now seen corresponding path program 1 times [2023-02-17 00:23:32,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:32,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965441862] [2023-02-17 00:23:32,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:32,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:32,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:32,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965441862] [2023-02-17 00:23:32,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965441862] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:32,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:32,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:32,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533866878] [2023-02-17 00:23:32,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:32,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:32,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:32,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:32,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:32,437 INFO L87 Difference]: Start difference. First operand 6149 states and 8515 transitions. 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) [2023-02-17 00:23:32,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:32,541 INFO L93 Difference]: Finished difference Result 14089 states and 19525 transitions. [2023-02-17 00:23:32,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:32,542 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 [2023-02-17 00:23:32,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:32,554 INFO L225 Difference]: With dead ends: 14089 [2023-02-17 00:23:32,555 INFO L226 Difference]: Without dead ends: 8071 [2023-02-17 00:23:32,562 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 [2023-02-17 00:23:32,562 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:32,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 164 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:32,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8071 states. [2023-02-17 00:23:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8071 to 8069. [2023-02-17 00:23:32,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:32,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8069 states to 8069 states and 11011 transitions. [2023-02-17 00:23:32,802 INFO L78 Accepts]: Start accepts. Automaton has 8069 states and 11011 transitions. Word has length 25 [2023-02-17 00:23:32,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:32,802 INFO L495 AbstractCegarLoop]: Abstraction has 8069 states and 11011 transitions. [2023-02-17 00:23:32,802 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) [2023-02-17 00:23:32,802 INFO L276 IsEmpty]: Start isEmpty. Operand 8069 states and 11011 transitions. [2023-02-17 00:23:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 00:23:32,810 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:32,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:32,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-17 00:23:32,810 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:32,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:32,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1040733483, now seen corresponding path program 1 times [2023-02-17 00:23:32,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:32,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284582054] [2023-02-17 00:23:32,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:32,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:32,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:32,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284582054] [2023-02-17 00:23:32,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284582054] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:32,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:32,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:32,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972116802] [2023-02-17 00:23:32,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:32,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:32,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:32,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:32,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:32,826 INFO L87 Difference]: Start difference. First operand 8069 states and 11011 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:32,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:32,964 INFO L93 Difference]: Finished difference Result 12105 states and 16453 transitions. [2023-02-17 00:23:32,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:32,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2023-02-17 00:23:32,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:32,978 INFO L225 Difference]: With dead ends: 12105 [2023-02-17 00:23:32,978 INFO L226 Difference]: Without dead ends: 8199 [2023-02-17 00:23:32,982 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 [2023-02-17 00:23:32,982 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 48 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:32,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:32,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8199 states. [2023-02-17 00:23:33,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 8197. [2023-02-17 00:23:33,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 11011 transitions. [2023-02-17 00:23:33,191 INFO L78 Accepts]: Start accepts. Automaton has 8197 states and 11011 transitions. Word has length 26 [2023-02-17 00:23:33,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:33,191 INFO L495 AbstractCegarLoop]: Abstraction has 8197 states and 11011 transitions. [2023-02-17 00:23:33,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:33,191 INFO L276 IsEmpty]: Start isEmpty. Operand 8197 states and 11011 transitions. [2023-02-17 00:23:33,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 00:23:33,199 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:33,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:33,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-17 00:23:33,200 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:33,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:33,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1974370135, now seen corresponding path program 1 times [2023-02-17 00:23:33,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:33,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586987914] [2023-02-17 00:23:33,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:33,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:33,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:33,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586987914] [2023-02-17 00:23:33,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586987914] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:33,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:33,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:33,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396664469] [2023-02-17 00:23:33,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:33,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:33,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:33,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:33,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:33,218 INFO L87 Difference]: Start difference. First operand 8197 states and 11011 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:33,431 INFO L93 Difference]: Finished difference Result 13833 states and 18821 transitions. [2023-02-17 00:23:33,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:33,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2023-02-17 00:23:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:33,452 INFO L225 Difference]: With dead ends: 13833 [2023-02-17 00:23:33,452 INFO L226 Difference]: Without dead ends: 13831 [2023-02-17 00:23:33,456 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 [2023-02-17 00:23:33,456 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 29 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:33,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:33,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13831 states. [2023-02-17 00:23:33,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13831 to 12293. [2023-02-17 00:23:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12293 states, 12292 states have (on average 1.3019036771884152) internal successors, (16003), 12292 states have internal predecessors, (16003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12293 states to 12293 states and 16003 transitions. [2023-02-17 00:23:33,736 INFO L78 Accepts]: Start accepts. Automaton has 12293 states and 16003 transitions. Word has length 26 [2023-02-17 00:23:33,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:33,736 INFO L495 AbstractCegarLoop]: Abstraction has 12293 states and 16003 transitions. [2023-02-17 00:23:33,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:33,736 INFO L276 IsEmpty]: Start isEmpty. Operand 12293 states and 16003 transitions. [2023-02-17 00:23:33,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 00:23:33,750 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:33,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:33,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-17 00:23:33,750 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:33,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:33,751 INFO L85 PathProgramCache]: Analyzing trace with hash 963252885, now seen corresponding path program 1 times [2023-02-17 00:23:33,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:33,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776496323] [2023-02-17 00:23:33,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:33,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:33,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:33,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:33,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776496323] [2023-02-17 00:23:33,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776496323] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:33,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:33,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:33,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763234651] [2023-02-17 00:23:33,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:33,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:33,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:33,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:33,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:33,770 INFO L87 Difference]: Start difference. First operand 12293 states and 16003 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:34,020 INFO L93 Difference]: Finished difference Result 27913 states and 36229 transitions. [2023-02-17 00:23:34,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:34,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2023-02-17 00:23:34,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:34,045 INFO L225 Difference]: With dead ends: 27913 [2023-02-17 00:23:34,045 INFO L226 Difference]: Without dead ends: 15879 [2023-02-17 00:23:34,057 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 [2023-02-17 00:23:34,057 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 45 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:34,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:34,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15879 states. [2023-02-17 00:23:34,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15879 to 15877. [2023-02-17 00:23:34,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15877 states, 15876 states have (on average 1.2740614764424287) internal successors, (20227), 15876 states have internal predecessors, (20227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15877 states to 15877 states and 20227 transitions. [2023-02-17 00:23:34,462 INFO L78 Accepts]: Start accepts. Automaton has 15877 states and 20227 transitions. Word has length 26 [2023-02-17 00:23:34,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:34,462 INFO L495 AbstractCegarLoop]: Abstraction has 15877 states and 20227 transitions. [2023-02-17 00:23:34,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:34,463 INFO L276 IsEmpty]: Start isEmpty. Operand 15877 states and 20227 transitions. [2023-02-17 00:23:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 00:23:34,478 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:34,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:34,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-17 00:23:34,480 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:34,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:34,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1076147793, now seen corresponding path program 1 times [2023-02-17 00:23:34,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:34,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396725844] [2023-02-17 00:23:34,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:34,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:34,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:34,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396725844] [2023-02-17 00:23:34,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396725844] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:34,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:34,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:34,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508912785] [2023-02-17 00:23:34,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:34,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:34,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:34,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:34,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:34,508 INFO L87 Difference]: Start difference. First operand 15877 states and 20227 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:34,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:34,728 INFO L93 Difference]: Finished difference Result 23817 states and 30213 transitions. [2023-02-17 00:23:34,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:34,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2023-02-17 00:23:34,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:34,758 INFO L225 Difference]: With dead ends: 23817 [2023-02-17 00:23:34,758 INFO L226 Difference]: Without dead ends: 16135 [2023-02-17 00:23:34,770 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 [2023-02-17 00:23:34,771 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 47 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:34,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16135 states. [2023-02-17 00:23:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16135 to 16133. [2023-02-17 00:23:35,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16133 states, 16132 states have (on average 1.2538432928341186) internal successors, (20227), 16132 states have internal predecessors, (20227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:35,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16133 states to 16133 states and 20227 transitions. [2023-02-17 00:23:35,164 INFO L78 Accepts]: Start accepts. Automaton has 16133 states and 20227 transitions. Word has length 27 [2023-02-17 00:23:35,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:35,164 INFO L495 AbstractCegarLoop]: Abstraction has 16133 states and 20227 transitions. [2023-02-17 00:23:35,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:35,164 INFO L276 IsEmpty]: Start isEmpty. Operand 16133 states and 20227 transitions. [2023-02-17 00:23:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 00:23:35,177 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:35,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:35,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-17 00:23:35,177 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:35,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:35,178 INFO L85 PathProgramCache]: Analyzing trace with hash -203715885, now seen corresponding path program 1 times [2023-02-17 00:23:35,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:35,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519591740] [2023-02-17 00:23:35,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:35,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:35,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:35,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519591740] [2023-02-17 00:23:35,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519591740] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:35,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:35,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:35,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34005455] [2023-02-17 00:23:35,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:35,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:35,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:35,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:35,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:35,194 INFO L87 Difference]: Start difference. First operand 16133 states and 20227 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:35,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:35,589 INFO L93 Difference]: Finished difference Result 26633 states and 33541 transitions. [2023-02-17 00:23:35,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:35,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2023-02-17 00:23:35,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:35,639 INFO L225 Difference]: With dead ends: 26633 [2023-02-17 00:23:35,639 INFO L226 Difference]: Without dead ends: 26631 [2023-02-17 00:23:35,644 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 [2023-02-17 00:23:35,645 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 26 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:35,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:35,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26631 states. [2023-02-17 00:23:36,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26631 to 24581. [2023-02-17 00:23:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24581 states, 24580 states have (on average 1.2186737184703011) internal successors, (29955), 24580 states have internal predecessors, (29955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24581 states to 24581 states and 29955 transitions. [2023-02-17 00:23:36,083 INFO L78 Accepts]: Start accepts. Automaton has 24581 states and 29955 transitions. Word has length 27 [2023-02-17 00:23:36,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:36,083 INFO L495 AbstractCegarLoop]: Abstraction has 24581 states and 29955 transitions. [2023-02-17 00:23:36,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:36,084 INFO L276 IsEmpty]: Start isEmpty. Operand 24581 states and 29955 transitions. [2023-02-17 00:23:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 00:23:36,110 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:36,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:36,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-17 00:23:36,110 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:36,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1214833135, now seen corresponding path program 1 times [2023-02-17 00:23:36,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:36,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848938339] [2023-02-17 00:23:36,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:36,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:36,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:36,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:36,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848938339] [2023-02-17 00:23:36,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848938339] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:36,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:36,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:36,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906953338] [2023-02-17 00:23:36,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:36,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:36,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:36,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:36,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:36,139 INFO L87 Difference]: Start difference. First operand 24581 states and 29955 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:36,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:36,590 INFO L93 Difference]: Finished difference Result 55305 states and 66821 transitions. [2023-02-17 00:23:36,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:36,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2023-02-17 00:23:36,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:36,627 INFO L225 Difference]: With dead ends: 55305 [2023-02-17 00:23:36,627 INFO L226 Difference]: Without dead ends: 31239 [2023-02-17 00:23:36,652 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 [2023-02-17 00:23:36,653 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 44 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:36,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 166 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31239 states. [2023-02-17 00:23:37,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31239 to 31237. [2023-02-17 00:23:37,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31237 states, 31236 states have (on average 1.1802727621974645) internal successors, (36867), 31236 states have internal predecessors, (36867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31237 states to 31237 states and 36867 transitions. [2023-02-17 00:23:37,437 INFO L78 Accepts]: Start accepts. Automaton has 31237 states and 36867 transitions. Word has length 27 [2023-02-17 00:23:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:37,437 INFO L495 AbstractCegarLoop]: Abstraction has 31237 states and 36867 transitions. [2023-02-17 00:23:37,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 31237 states and 36867 transitions. [2023-02-17 00:23:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-17 00:23:37,460 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:37,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:37,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-02-17 00:23:37,460 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:37,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:37,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2020009046, now seen corresponding path program 1 times [2023-02-17 00:23:37,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:37,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399053608] [2023-02-17 00:23:37,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:37,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:37,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:37,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399053608] [2023-02-17 00:23:37,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399053608] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:37,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:37,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:37,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392512701] [2023-02-17 00:23:37,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:37,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:37,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:37,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:37,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:37,479 INFO L87 Difference]: Start difference. First operand 31237 states and 36867 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:38,010 INFO L93 Difference]: Finished difference Result 46857 states and 55045 transitions. [2023-02-17 00:23:38,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:38,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2023-02-17 00:23:38,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:38,053 INFO L225 Difference]: With dead ends: 46857 [2023-02-17 00:23:38,053 INFO L226 Difference]: Without dead ends: 31751 [2023-02-17 00:23:38,066 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 [2023-02-17 00:23:38,066 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 46 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:38,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:38,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31751 states. [2023-02-17 00:23:38,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31751 to 31749. [2023-02-17 00:23:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31749 states, 31748 states have (on average 1.1612385032128008) internal successors, (36867), 31748 states have internal predecessors, (36867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31749 states to 31749 states and 36867 transitions. [2023-02-17 00:23:38,783 INFO L78 Accepts]: Start accepts. Automaton has 31749 states and 36867 transitions. Word has length 28 [2023-02-17 00:23:38,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:38,784 INFO L495 AbstractCegarLoop]: Abstraction has 31749 states and 36867 transitions. [2023-02-17 00:23:38,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:38,784 INFO L276 IsEmpty]: Start isEmpty. Operand 31749 states and 36867 transitions. [2023-02-17 00:23:38,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-17 00:23:38,802 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:38,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:38,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-02-17 00:23:38,803 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:38,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:38,804 INFO L85 PathProgramCache]: Analyzing trace with hash 995094572, now seen corresponding path program 1 times [2023-02-17 00:23:38,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:38,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480723647] [2023-02-17 00:23:38,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:38,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:38,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:38,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:38,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480723647] [2023-02-17 00:23:38,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480723647] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:38,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:38,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:38,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468406641] [2023-02-17 00:23:38,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:38,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:38,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:38,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:38,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:38,819 INFO L87 Difference]: Start difference. First operand 31749 states and 36867 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:39,468 INFO L93 Difference]: Finished difference Result 92167 states and 104452 transitions. [2023-02-17 00:23:39,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:39,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2023-02-17 00:23:39,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:39,505 INFO L225 Difference]: With dead ends: 92167 [2023-02-17 00:23:39,506 INFO L226 Difference]: Without dead ends: 31749 [2023-02-17 00:23:39,537 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 [2023-02-17 00:23:39,538 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 43 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:39,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 138 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:39,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31749 states. [2023-02-17 00:23:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31749 to 31749. [2023-02-17 00:23:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31749 states, 31748 states have (on average 1.096730502708832) internal successors, (34819), 31748 states have internal predecessors, (34819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31749 states to 31749 states and 34819 transitions. [2023-02-17 00:23:40,078 INFO L78 Accepts]: Start accepts. Automaton has 31749 states and 34819 transitions. Word has length 28 [2023-02-17 00:23:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:40,079 INFO L495 AbstractCegarLoop]: Abstraction has 31749 states and 34819 transitions. [2023-02-17 00:23:40,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 31749 states and 34819 transitions. [2023-02-17 00:23:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-17 00:23:40,098 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:40,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:40,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-02-17 00:23:40,098 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:40,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:40,099 INFO L85 PathProgramCache]: Analyzing trace with hash 2006211822, now seen corresponding path program 1 times [2023-02-17 00:23:40,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:40,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454444358] [2023-02-17 00:23:40,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:40,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:40,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:40,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:40,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454444358] [2023-02-17 00:23:40,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454444358] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:40,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:40,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:40,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776734489] [2023-02-17 00:23:40,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:40,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:40,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:40,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:40,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:40,114 INFO L87 Difference]: Start difference. First operand 31749 states and 34819 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:40,457 INFO L93 Difference]: Finished difference Result 31749 states and 34819 transitions. [2023-02-17 00:23:40,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:40,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2023-02-17 00:23:40,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:40,458 INFO L225 Difference]: With dead ends: 31749 [2023-02-17 00:23:40,458 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 00:23:40,471 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 [2023-02-17 00:23:40,472 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:40,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 78 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:40,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 00:23:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 00:23:40,473 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) [2023-02-17 00:23:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 00:23:40,473 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2023-02-17 00:23:40,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:40,473 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 00:23:40,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:40,473 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 00:23:40,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 00:23:40,476 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 00:23:40,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-02-17 00:23:40,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 00:23:40,488 INFO L899 garLoopResultBuilder]: For program point L159-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,488 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,488 INFO L899 garLoopResultBuilder]: For program point L85-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,488 INFO L899 garLoopResultBuilder]: For program point L77-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,488 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 6 179) the Hoare annotation is: true [2023-02-17 00:23:40,488 INFO L899 garLoopResultBuilder]: For program point L135(line 135) no Hoare annotation was computed. [2023-02-17 00:23:40,488 INFO L899 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2023-02-17 00:23:40,488 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 00:23:40,489 INFO L899 garLoopResultBuilder]: For program point L119-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,489 INFO L899 garLoopResultBuilder]: For program point L144-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,489 INFO L902 garLoopResultBuilder]: At program point L169-1(lines 44 174) the Hoare annotation is: true [2023-02-17 00:23:40,489 INFO L899 garLoopResultBuilder]: For program point L120(line 120) no Hoare annotation was computed. [2023-02-17 00:23:40,489 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2023-02-17 00:23:40,489 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 48) no Hoare annotation was computed. [2023-02-17 00:23:40,489 INFO L899 garLoopResultBuilder]: For program point L170(line 170) no Hoare annotation was computed. [2023-02-17 00:23:40,489 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 00:23:40,489 INFO L899 garLoopResultBuilder]: For program point L129-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,489 INFO L899 garLoopResultBuilder]: For program point L154-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,489 INFO L899 garLoopResultBuilder]: For program point L113-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,489 INFO L899 garLoopResultBuilder]: For program point L105-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,489 INFO L899 garLoopResultBuilder]: For program point L130(line 130) no Hoare annotation was computed. [2023-02-17 00:23:40,490 INFO L899 garLoopResultBuilder]: For program point L97-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,490 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2023-02-17 00:23:40,490 INFO L899 garLoopResultBuilder]: For program point L89-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,490 INFO L899 garLoopResultBuilder]: For program point L81-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,490 INFO L899 garLoopResultBuilder]: For program point L139-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,490 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 75) no Hoare annotation was computed. [2023-02-17 00:23:40,490 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,490 INFO L899 garLoopResultBuilder]: For program point L164-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,490 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 00:23:40,490 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2023-02-17 00:23:40,491 INFO L899 garLoopResultBuilder]: For program point L140(line 140) no Hoare annotation was computed. [2023-02-17 00:23:40,491 INFO L899 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2023-02-17 00:23:40,491 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 00:23:40,491 INFO L899 garLoopResultBuilder]: For program point L124-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,491 INFO L899 garLoopResultBuilder]: For program point L149-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,491 INFO L899 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2023-02-17 00:23:40,491 INFO L895 garLoopResultBuilder]: At program point main_ERROR#1(lines 7 179) the Hoare annotation is: false [2023-02-17 00:23:40,491 INFO L899 garLoopResultBuilder]: For program point L150(line 150) no Hoare annotation was computed. [2023-02-17 00:23:40,491 INFO L902 garLoopResultBuilder]: At program point L175(lines 7 179) the Hoare annotation is: true [2023-02-17 00:23:40,492 INFO L899 garLoopResultBuilder]: For program point L109-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,492 INFO L899 garLoopResultBuilder]: For program point L134-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,492 INFO L899 garLoopResultBuilder]: For program point L101-1(lines 44 174) no Hoare annotation was computed. [2023-02-17 00:23:40,495 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:40,497 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 00:23:40,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 12:23:40 BoogieIcfgContainer [2023-02-17 00:23:40,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 00:23:40,505 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 00:23:40,505 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 00:23:40,505 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 00:23:40,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:23:29" (3/4) ... [2023-02-17 00:23:40,520 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 00:23:40,533 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-02-17 00:23:40,533 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 00:23:40,534 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 00:23:40,534 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 00:23:40,593 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 00:23:40,593 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 00:23:40,595 INFO L158 Benchmark]: Toolchain (without parser) took 11890.20ms. Allocated memory was 115.3MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 75.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-02-17 00:23:40,595 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 115.3MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 00:23:40,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.34ms. Allocated memory is still 115.3MB. Free memory was 75.5MB in the beginning and 64.4MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 00:23:40,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.24ms. Allocated memory is still 115.3MB. Free memory was 64.4MB in the beginning and 62.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 00:23:40,597 INFO L158 Benchmark]: Boogie Preprocessor took 21.44ms. Allocated memory is still 115.3MB. Free memory was 62.7MB in the beginning and 61.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 00:23:40,598 INFO L158 Benchmark]: RCFGBuilder took 419.35ms. Allocated memory was 115.3MB in the beginning and 140.5MB in the end (delta: 25.2MB). Free memory was 61.2MB in the beginning and 111.3MB in the end (delta: -50.1MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2023-02-17 00:23:40,602 INFO L158 Benchmark]: TraceAbstraction took 11082.70ms. Allocated memory was 140.5MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 110.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-02-17 00:23:40,602 INFO L158 Benchmark]: Witness Printer took 88.74ms. Allocated memory is still 2.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 00:23:40,603 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.22ms. Allocated memory is still 115.3MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.34ms. Allocated memory is still 115.3MB. Free memory was 75.5MB in the beginning and 64.4MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.24ms. Allocated memory is still 115.3MB. Free memory was 64.4MB in the beginning and 62.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.44ms. Allocated memory is still 115.3MB. Free memory was 62.7MB in the beginning and 61.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 419.35ms. Allocated memory was 115.3MB in the beginning and 140.5MB in the end (delta: 25.2MB). Free memory was 61.2MB in the beginning and 111.3MB in the end (delta: -50.1MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11082.70ms. Allocated memory was 140.5MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 110.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 88.74ms. Allocated memory is still 2.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 177]: 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, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 31, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1400 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1400 mSDsluCounter, 4588 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1835 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 163 IncrementalHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 2753 mSDtfsCounter, 163 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31749occurred in iteration=29, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.8s AutomataMinimizationTime, 31 MinimizatonAttempts, 6176 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 2057 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 720 NumberOfCodeBlocks, 720 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 689 ConstructedInterpolants, 0 QuantifiedInterpolants, 1492 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 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: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2023-02-17 00:23:40,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE