./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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_13.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 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:57:13,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:57:13,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:57:13,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:57:13,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:57:13,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:57:13,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:57:13,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:57:13,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:57:13,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:57:13,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:57:13,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:57:13,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:57:13,629 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:57:13,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:57:13,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:57:13,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:57:13,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:57:13,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:57:13,636 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:57:13,637 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:57:13,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:57:13,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:57:13,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:57:13,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:57:13,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:57:13,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:57:13,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:57:13,645 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:57:13,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:57:13,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:57:13,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:57:13,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:57:13,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:57:13,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:57:13,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:57:13,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:57:13,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:57:13,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:57:13,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:57:13,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:57:13,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:57:13,653 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:57:13,671 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:57:13,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:57:13,672 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:57:13,672 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:57:13,673 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:57:13,673 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:57:13,674 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:57:13,674 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:57:13,674 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:57:13,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:57:13,675 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:57:13,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:57:13,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:57:13,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:57:13,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:57:13,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:57:13,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:57:13,676 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:57:13,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:57:13,677 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:57:13,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:57:13,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:57:13,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:57:13,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:57:13,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:57:13,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:57:13,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:57:13,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:57:13,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:57:13,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:57:13,680 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:57:13,680 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:57:13,680 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:57:13,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2022-07-19 10:57:13,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:57:13,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:57:13,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:57:13,924 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:57:13,924 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:57:13,925 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_13.c [2022-07-19 10:57:13,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e41e0bd6/4726e873eec74bb6ac0aecc429659e6f/FLAG9b3fb2407 [2022-07-19 10:57:14,380 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:57:14,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2022-07-19 10:57:14,393 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e41e0bd6/4726e873eec74bb6ac0aecc429659e6f/FLAG9b3fb2407 [2022-07-19 10:57:14,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e41e0bd6/4726e873eec74bb6ac0aecc429659e6f [2022-07-19 10:57:14,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:57:14,802 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:57:14,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:57:14,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:57:14,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:57:14,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:57:14" (1/1) ... [2022-07-19 10:57:14,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e137d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:14, skipping insertion in model container [2022-07-19 10:57:14,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:57:14" (1/1) ... [2022-07-19 10:57:14,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:57:14,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:57:14,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2022-07-19 10:57:15,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:57:15,009 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:57:15,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2022-07-19 10:57:15,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:57:15,067 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:57:15,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:15 WrapperNode [2022-07-19 10:57:15,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:57:15,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:57:15,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:57:15,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:57:15,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:15" (1/1) ... [2022-07-19 10:57:15,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:15" (1/1) ... [2022-07-19 10:57:15,115 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 171 [2022-07-19 10:57:15,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:57:15,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:57:15,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:57:15,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:57:15,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:15" (1/1) ... [2022-07-19 10:57:15,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:15" (1/1) ... [2022-07-19 10:57:15,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:15" (1/1) ... [2022-07-19 10:57:15,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:15" (1/1) ... [2022-07-19 10:57:15,142 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:15" (1/1) ... [2022-07-19 10:57:15,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:15" (1/1) ... [2022-07-19 10:57:15,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:15" (1/1) ... [2022-07-19 10:57:15,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:57:15,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:57:15,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:57:15,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:57:15,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:15" (1/1) ... [2022-07-19 10:57:15,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:57:15,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:57:15,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 10:57:15,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 10:57:15,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:57:15,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:57:15,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:57:15,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:57:15,293 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:57:15,295 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:57:15,516 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:57:15,522 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:57:15,523 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 10:57:15,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:57:15 BoogieIcfgContainer [2022-07-19 10:57:15,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:57:15,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:57:15,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:57:15,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:57:15,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:57:14" (1/3) ... [2022-07-19 10:57:15,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3796b252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:57:15, skipping insertion in model container [2022-07-19 10:57:15,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:15" (2/3) ... [2022-07-19 10:57:15,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3796b252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:57:15, skipping insertion in model container [2022-07-19 10:57:15,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:57:15" (3/3) ... [2022-07-19 10:57:15,539 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2022-07-19 10:57:15,551 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:57:15,556 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:57:15,598 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:57:15,603 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@298c3273, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@63b18f46 [2022-07-19 10:57:15,604 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:57:15,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 10:57:15,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:15,622 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] [2022-07-19 10:57:15,623 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:15,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:15,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1359894467, now seen corresponding path program 1 times [2022-07-19 10:57:15,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:15,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984867752] [2022-07-19 10:57:15,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:15,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:15,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:15,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984867752] [2022-07-19 10:57:15,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984867752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:15,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:15,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:15,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517457863] [2022-07-19 10:57:15,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:15,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:15,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:15,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:15,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:15,832 INFO L87 Difference]: Start difference. First operand has 49 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 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.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) [2022-07-19 10:57:15,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:15,888 INFO L93 Difference]: Finished difference Result 101 states and 181 transitions. [2022-07-19 10:57:15,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:15,891 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 [2022-07-19 10:57:15,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:15,902 INFO L225 Difference]: With dead ends: 101 [2022-07-19 10:57:15,903 INFO L226 Difference]: Without dead ends: 87 [2022-07-19 10:57:15,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:15,916 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 67 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 175 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 [2022-07-19 10:57:15,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:15,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-19 10:57:15,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2022-07-19 10:57:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.896551724137931) internal successors, (110), 58 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 110 transitions. [2022-07-19 10:57:15,948 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 110 transitions. Word has length 20 [2022-07-19 10:57:15,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:15,948 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 110 transitions. [2022-07-19 10:57:15,948 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) [2022-07-19 10:57:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 110 transitions. [2022-07-19 10:57:15,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 10:57:15,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:15,949 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] [2022-07-19 10:57:15,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:57:15,950 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:15,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:15,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1914004475, now seen corresponding path program 1 times [2022-07-19 10:57:15,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:15,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370798798] [2022-07-19 10:57:15,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:15,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:16,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:16,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370798798] [2022-07-19 10:57:16,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370798798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:16,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:16,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:16,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006579203] [2022-07-19 10:57:16,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:16,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:16,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:16,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:16,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,025 INFO L87 Difference]: Start difference. First operand 59 states and 110 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) [2022-07-19 10:57:16,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:16,045 INFO L93 Difference]: Finished difference Result 144 states and 269 transitions. [2022-07-19 10:57:16,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:16,046 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 [2022-07-19 10:57:16,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:16,047 INFO L225 Difference]: With dead ends: 144 [2022-07-19 10:57:16,047 INFO L226 Difference]: Without dead ends: 87 [2022-07-19 10:57:16,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,049 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 63 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 185 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 [2022-07-19 10:57:16,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 185 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:16,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-19 10:57:16,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2022-07-19 10:57:16,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.880952380952381) internal successors, (158), 84 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 158 transitions. [2022-07-19 10:57:16,060 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 158 transitions. Word has length 20 [2022-07-19 10:57:16,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:16,060 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 158 transitions. [2022-07-19 10:57:16,060 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) [2022-07-19 10:57:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 158 transitions. [2022-07-19 10:57:16,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 10:57:16,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:16,062 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] [2022-07-19 10:57:16,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:57:16,062 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:16,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:16,063 INFO L85 PathProgramCache]: Analyzing trace with hash 793156859, now seen corresponding path program 1 times [2022-07-19 10:57:16,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:16,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100102759] [2022-07-19 10:57:16,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:16,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:16,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:16,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100102759] [2022-07-19 10:57:16,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100102759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:16,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:16,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:16,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912097955] [2022-07-19 10:57:16,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:16,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:16,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:16,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:16,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,119 INFO L87 Difference]: Start difference. First operand 85 states and 158 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) [2022-07-19 10:57:16,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:16,147 INFO L93 Difference]: Finished difference Result 132 states and 240 transitions. [2022-07-19 10:57:16,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:16,147 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 [2022-07-19 10:57:16,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:16,148 INFO L225 Difference]: With dead ends: 132 [2022-07-19 10:57:16,149 INFO L226 Difference]: Without dead ends: 90 [2022-07-19 10:57:16,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,150 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 65 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 208 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 [2022-07-19 10:57:16,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:16,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-19 10:57:16,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2022-07-19 10:57:16,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.839080459770115) internal successors, (160), 87 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 160 transitions. [2022-07-19 10:57:16,159 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 160 transitions. Word has length 21 [2022-07-19 10:57:16,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:16,159 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 160 transitions. [2022-07-19 10:57:16,160 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) [2022-07-19 10:57:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 160 transitions. [2022-07-19 10:57:16,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 10:57:16,161 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:16,161 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] [2022-07-19 10:57:16,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 10:57:16,161 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:16,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:16,162 INFO L85 PathProgramCache]: Analyzing trace with hash -795191043, now seen corresponding path program 1 times [2022-07-19 10:57:16,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:16,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963880249] [2022-07-19 10:57:16,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:16,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:16,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:16,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963880249] [2022-07-19 10:57:16,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963880249] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:16,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:16,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:16,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24645857] [2022-07-19 10:57:16,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:16,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:16,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:16,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:16,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,246 INFO L87 Difference]: Start difference. First operand 88 states and 160 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) [2022-07-19 10:57:16,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:16,272 INFO L93 Difference]: Finished difference Result 169 states and 309 transitions. [2022-07-19 10:57:16,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:16,273 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 [2022-07-19 10:57:16,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:16,274 INFO L225 Difference]: With dead ends: 169 [2022-07-19 10:57:16,274 INFO L226 Difference]: Without dead ends: 167 [2022-07-19 10:57:16,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,276 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 60 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 161 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 [2022-07-19 10:57:16,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 161 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:16,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-19 10:57:16,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 117. [2022-07-19 10:57:16,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.8362068965517242) internal successors, (213), 116 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 213 transitions. [2022-07-19 10:57:16,287 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 213 transitions. Word has length 21 [2022-07-19 10:57:16,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:16,287 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 213 transitions. [2022-07-19 10:57:16,287 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) [2022-07-19 10:57:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 213 transitions. [2022-07-19 10:57:16,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 10:57:16,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:16,289 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] [2022-07-19 10:57:16,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 10:57:16,289 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:16,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:16,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1816259397, now seen corresponding path program 1 times [2022-07-19 10:57:16,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:16,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767105487] [2022-07-19 10:57:16,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:16,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:16,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:16,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:16,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767105487] [2022-07-19 10:57:16,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767105487] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:16,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:16,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:16,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466749154] [2022-07-19 10:57:16,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:16,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:16,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:16,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:16,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,347 INFO L87 Difference]: Start difference. First operand 117 states and 213 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) [2022-07-19 10:57:16,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:16,360 INFO L93 Difference]: Finished difference Result 281 states and 515 transitions. [2022-07-19 10:57:16,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:16,360 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 [2022-07-19 10:57:16,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:16,362 INFO L225 Difference]: With dead ends: 281 [2022-07-19 10:57:16,362 INFO L226 Difference]: Without dead ends: 169 [2022-07-19 10:57:16,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,364 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 186 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 [2022-07-19 10:57:16,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 186 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:16,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-19 10:57:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2022-07-19 10:57:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.8253012048192772) internal successors, (303), 166 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:16,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 303 transitions. [2022-07-19 10:57:16,376 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 303 transitions. Word has length 21 [2022-07-19 10:57:16,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:16,376 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 303 transitions. [2022-07-19 10:57:16,376 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) [2022-07-19 10:57:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 303 transitions. [2022-07-19 10:57:16,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 10:57:16,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:16,378 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] [2022-07-19 10:57:16,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 10:57:16,378 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:16,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:16,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1119094160, now seen corresponding path program 1 times [2022-07-19 10:57:16,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:16,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348851676] [2022-07-19 10:57:16,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:16,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:16,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:16,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348851676] [2022-07-19 10:57:16,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348851676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:16,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:16,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:16,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293467199] [2022-07-19 10:57:16,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:16,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:16,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:16,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:16,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,412 INFO L87 Difference]: Start difference. First operand 167 states and 303 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) [2022-07-19 10:57:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:16,423 INFO L93 Difference]: Finished difference Result 252 states and 454 transitions. [2022-07-19 10:57:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:16,424 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 [2022-07-19 10:57:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:16,425 INFO L225 Difference]: With dead ends: 252 [2022-07-19 10:57:16,425 INFO L226 Difference]: Without dead ends: 171 [2022-07-19 10:57:16,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,427 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 204 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 [2022-07-19 10:57:16,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:16,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-19 10:57:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2022-07-19 10:57:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.8035714285714286) internal successors, (303), 168 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:16,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 303 transitions. [2022-07-19 10:57:16,438 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 303 transitions. Word has length 22 [2022-07-19 10:57:16,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:16,439 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 303 transitions. [2022-07-19 10:57:16,439 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) [2022-07-19 10:57:16,439 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 303 transitions. [2022-07-19 10:57:16,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 10:57:16,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:16,440 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] [2022-07-19 10:57:16,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 10:57:16,441 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:16,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:16,441 INFO L85 PathProgramCache]: Analyzing trace with hash -469253742, now seen corresponding path program 1 times [2022-07-19 10:57:16,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:16,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285904533] [2022-07-19 10:57:16,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:16,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:16,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:16,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285904533] [2022-07-19 10:57:16,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285904533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:16,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:16,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:16,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107748931] [2022-07-19 10:57:16,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:16,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:16,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:16,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:16,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,491 INFO L87 Difference]: Start difference. First operand 169 states and 303 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) [2022-07-19 10:57:16,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:16,514 INFO L93 Difference]: Finished difference Result 489 states and 881 transitions. [2022-07-19 10:57:16,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:16,514 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 [2022-07-19 10:57:16,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:16,516 INFO L225 Difference]: With dead ends: 489 [2022-07-19 10:57:16,516 INFO L226 Difference]: Without dead ends: 327 [2022-07-19 10:57:16,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,518 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 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 [2022-07-19 10:57:16,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:16,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-07-19 10:57:16,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2022-07-19 10:57:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.787037037037037) internal successors, (579), 324 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:16,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 579 transitions. [2022-07-19 10:57:16,543 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 579 transitions. Word has length 22 [2022-07-19 10:57:16,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:16,549 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 579 transitions. [2022-07-19 10:57:16,549 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) [2022-07-19 10:57:16,549 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 579 transitions. [2022-07-19 10:57:16,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 10:57:16,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:16,554 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] [2022-07-19 10:57:16,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 10:57:16,555 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:16,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:16,556 INFO L85 PathProgramCache]: Analyzing trace with hash 551814612, now seen corresponding path program 1 times [2022-07-19 10:57:16,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:16,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100787726] [2022-07-19 10:57:16,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:16,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:16,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:16,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100787726] [2022-07-19 10:57:16,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100787726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:16,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:16,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:16,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314052702] [2022-07-19 10:57:16,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:16,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:16,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:16,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:16,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,617 INFO L87 Difference]: Start difference. First operand 325 states and 579 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) [2022-07-19 10:57:16,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:16,637 INFO L93 Difference]: Finished difference Result 417 states and 749 transitions. [2022-07-19 10:57:16,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:16,637 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 [2022-07-19 10:57:16,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:16,639 INFO L225 Difference]: With dead ends: 417 [2022-07-19 10:57:16,639 INFO L226 Difference]: Without dead ends: 415 [2022-07-19 10:57:16,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,641 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 57 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 224 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 [2022-07-19 10:57:16,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 224 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:16,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-07-19 10:57:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 325. [2022-07-19 10:57:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.7746913580246915) internal successors, (575), 324 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 575 transitions. [2022-07-19 10:57:16,663 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 575 transitions. Word has length 22 [2022-07-19 10:57:16,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:16,664 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 575 transitions. [2022-07-19 10:57:16,664 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) [2022-07-19 10:57:16,664 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 575 transitions. [2022-07-19 10:57:16,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 10:57:16,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:16,669 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] [2022-07-19 10:57:16,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 10:57:16,669 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:16,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:16,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1661751056, now seen corresponding path program 1 times [2022-07-19 10:57:16,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:16,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404680741] [2022-07-19 10:57:16,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:16,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:16,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:16,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:16,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404680741] [2022-07-19 10:57:16,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404680741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:16,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:16,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:16,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202792592] [2022-07-19 10:57:16,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:16,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:16,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:16,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:16,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,697 INFO L87 Difference]: Start difference. First operand 325 states and 575 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) [2022-07-19 10:57:16,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:16,709 INFO L93 Difference]: Finished difference Result 613 states and 1097 transitions. [2022-07-19 10:57:16,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:16,710 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 [2022-07-19 10:57:16,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:16,712 INFO L225 Difference]: With dead ends: 613 [2022-07-19 10:57:16,712 INFO L226 Difference]: Without dead ends: 611 [2022-07-19 10:57:16,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,714 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 54 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 157 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 [2022-07-19 10:57:16,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-07-19 10:57:16,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 449. [2022-07-19 10:57:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.7477678571428572) internal successors, (783), 448 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 783 transitions. [2022-07-19 10:57:16,728 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 783 transitions. Word has length 23 [2022-07-19 10:57:16,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:16,729 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 783 transitions. [2022-07-19 10:57:16,729 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) [2022-07-19 10:57:16,729 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 783 transitions. [2022-07-19 10:57:16,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 10:57:16,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:16,730 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] [2022-07-19 10:57:16,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 10:57:16,730 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:16,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:16,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1612147886, now seen corresponding path program 1 times [2022-07-19 10:57:16,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:16,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212664112] [2022-07-19 10:57:16,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:16,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:16,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:16,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212664112] [2022-07-19 10:57:16,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212664112] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:16,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:16,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:16,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823086997] [2022-07-19 10:57:16,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:16,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:16,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:16,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:16,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,763 INFO L87 Difference]: Start difference. First operand 449 states and 783 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) [2022-07-19 10:57:16,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:16,782 INFO L93 Difference]: Finished difference Result 1077 states and 1889 transitions. [2022-07-19 10:57:16,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:16,782 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 [2022-07-19 10:57:16,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:16,785 INFO L225 Difference]: With dead ends: 1077 [2022-07-19 10:57:16,785 INFO L226 Difference]: Without dead ends: 635 [2022-07-19 10:57:16,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,787 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 60 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 188 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 [2022-07-19 10:57:16,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 188 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:16,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-07-19 10:57:16,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2022-07-19 10:57:16,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.7389240506329113) internal successors, (1099), 632 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:16,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1099 transitions. [2022-07-19 10:57:16,802 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1099 transitions. Word has length 23 [2022-07-19 10:57:16,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:16,803 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 1099 transitions. [2022-07-19 10:57:16,803 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) [2022-07-19 10:57:16,803 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1099 transitions. [2022-07-19 10:57:16,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:57:16,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:16,804 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] [2022-07-19 10:57:16,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 10:57:16,804 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:16,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:16,805 INFO L85 PathProgramCache]: Analyzing trace with hash 25538215, now seen corresponding path program 1 times [2022-07-19 10:57:16,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:16,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633942383] [2022-07-19 10:57:16,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:16,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:16,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:16,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:16,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633942383] [2022-07-19 10:57:16,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633942383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:16,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:16,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:16,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837366770] [2022-07-19 10:57:16,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:16,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:16,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:16,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:16,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,852 INFO L87 Difference]: Start difference. First operand 633 states and 1099 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) [2022-07-19 10:57:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:16,871 INFO L93 Difference]: Finished difference Result 957 states and 1657 transitions. [2022-07-19 10:57:16,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:16,872 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 [2022-07-19 10:57:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:16,874 INFO L225 Difference]: With dead ends: 957 [2022-07-19 10:57:16,874 INFO L226 Difference]: Without dead ends: 647 [2022-07-19 10:57:16,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,878 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 62 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 196 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 [2022-07-19 10:57:16,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-07-19 10:57:16,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 645. [2022-07-19 10:57:16,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.718944099378882) internal successors, (1107), 644 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1107 transitions. [2022-07-19 10:57:16,897 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1107 transitions. Word has length 24 [2022-07-19 10:57:16,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:16,897 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 1107 transitions. [2022-07-19 10:57:16,898 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) [2022-07-19 10:57:16,898 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1107 transitions. [2022-07-19 10:57:16,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:57:16,904 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:16,904 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] [2022-07-19 10:57:16,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 10:57:16,904 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:16,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:16,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1562809687, now seen corresponding path program 1 times [2022-07-19 10:57:16,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:16,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369991648] [2022-07-19 10:57:16,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:16,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:16,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:16,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:16,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369991648] [2022-07-19 10:57:16,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369991648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:16,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:16,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:16,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433756548] [2022-07-19 10:57:16,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:16,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:16,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:16,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:16,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,945 INFO L87 Difference]: Start difference. First operand 645 states and 1107 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) [2022-07-19 10:57:16,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:16,963 INFO L93 Difference]: Finished difference Result 1193 states and 2077 transitions. [2022-07-19 10:57:16,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:16,963 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 [2022-07-19 10:57:16,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:16,968 INFO L225 Difference]: With dead ends: 1193 [2022-07-19 10:57:16,968 INFO L226 Difference]: Without dead ends: 1191 [2022-07-19 10:57:16,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:16,969 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 51 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 155 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 [2022-07-19 10:57:16,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:16,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2022-07-19 10:57:16,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 901. [2022-07-19 10:57:16,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.6833333333333333) internal successors, (1515), 900 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:16,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1515 transitions. [2022-07-19 10:57:16,992 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1515 transitions. Word has length 24 [2022-07-19 10:57:16,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:16,993 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 1515 transitions. [2022-07-19 10:57:16,993 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) [2022-07-19 10:57:16,993 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1515 transitions. [2022-07-19 10:57:16,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:57:16,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:16,994 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] [2022-07-19 10:57:16,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 10:57:16,994 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:16,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:16,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1711089255, now seen corresponding path program 1 times [2022-07-19 10:57:16,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:16,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938191196] [2022-07-19 10:57:16,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:16,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:17,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:17,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:17,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938191196] [2022-07-19 10:57:17,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938191196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:17,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:17,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:17,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324316753] [2022-07-19 10:57:17,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:17,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:17,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:17,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:17,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:17,034 INFO L87 Difference]: Start difference. First operand 901 states and 1515 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) [2022-07-19 10:57:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:17,058 INFO L93 Difference]: Finished difference Result 2137 states and 3613 transitions. [2022-07-19 10:57:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:17,058 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 [2022-07-19 10:57:17,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:17,064 INFO L225 Difference]: With dead ends: 2137 [2022-07-19 10:57:17,064 INFO L226 Difference]: Without dead ends: 1255 [2022-07-19 10:57:17,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 [2022-07-19 10:57:17,068 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 59 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 189 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 [2022-07-19 10:57:17,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 189 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:17,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2022-07-19 10:57:17,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1253. [2022-07-19 10:57:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 1.676517571884984) internal successors, (2099), 1252 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2099 transitions. [2022-07-19 10:57:17,104 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2099 transitions. Word has length 24 [2022-07-19 10:57:17,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:17,105 INFO L495 AbstractCegarLoop]: Abstraction has 1253 states and 2099 transitions. [2022-07-19 10:57:17,105 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) [2022-07-19 10:57:17,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2099 transitions. [2022-07-19 10:57:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 10:57:17,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:17,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:17,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 10:57:17,107 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:17,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:17,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1202246301, now seen corresponding path program 1 times [2022-07-19 10:57:17,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:17,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315827360] [2022-07-19 10:57:17,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:17,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:17,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:17,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315827360] [2022-07-19 10:57:17,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315827360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:17,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:17,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:17,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591244603] [2022-07-19 10:57:17,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:17,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:17,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:17,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:17,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:17,134 INFO L87 Difference]: Start difference. First operand 1253 states and 2099 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) [2022-07-19 10:57:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:17,156 INFO L93 Difference]: Finished difference Result 1881 states and 3141 transitions. [2022-07-19 10:57:17,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:17,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-19 10:57:17,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:17,161 INFO L225 Difference]: With dead ends: 1881 [2022-07-19 10:57:17,161 INFO L226 Difference]: Without dead ends: 1271 [2022-07-19 10:57:17,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:17,163 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 61 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 192 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 [2022-07-19 10:57:17,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2022-07-19 10:57:17,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1269. [2022-07-19 10:57:17,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1268 states have (on average 1.6553627760252365) internal successors, (2099), 1268 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2099 transitions. [2022-07-19 10:57:17,192 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2099 transitions. Word has length 25 [2022-07-19 10:57:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:17,192 INFO L495 AbstractCegarLoop]: Abstraction has 1269 states and 2099 transitions. [2022-07-19 10:57:17,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2099 transitions. [2022-07-19 10:57:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 10:57:17,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:17,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:17,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 10:57:17,194 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:17,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:17,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1504373093, now seen corresponding path program 1 times [2022-07-19 10:57:17,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:17,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41744742] [2022-07-19 10:57:17,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:17,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:17,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:17,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41744742] [2022-07-19 10:57:17,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41744742] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:17,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:17,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:17,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015245168] [2022-07-19 10:57:17,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:17,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:17,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:17,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:17,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:17,214 INFO L87 Difference]: Start difference. First operand 1269 states and 2099 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) [2022-07-19 10:57:17,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:17,239 INFO L93 Difference]: Finished difference Result 2313 states and 3893 transitions. [2022-07-19 10:57:17,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:17,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-19 10:57:17,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:17,247 INFO L225 Difference]: With dead ends: 2313 [2022-07-19 10:57:17,247 INFO L226 Difference]: Without dead ends: 2311 [2022-07-19 10:57:17,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:17,248 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 48 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 153 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 [2022-07-19 10:57:17,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 153 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:17,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-07-19 10:57:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 1797. [2022-07-19 10:57:17,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1796 states have (on average 1.614142538975501) internal successors, (2899), 1796 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2899 transitions. [2022-07-19 10:57:17,292 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2899 transitions. Word has length 25 [2022-07-19 10:57:17,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:17,292 INFO L495 AbstractCegarLoop]: Abstraction has 1797 states and 2899 transitions. [2022-07-19 10:57:17,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:17,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2899 transitions. [2022-07-19 10:57:17,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 10:57:17,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:17,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:17,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 10:57:17,295 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:17,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:17,295 INFO L85 PathProgramCache]: Analyzing trace with hash 483304739, now seen corresponding path program 1 times [2022-07-19 10:57:17,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:17,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140888608] [2022-07-19 10:57:17,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:17,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:17,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:17,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:17,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140888608] [2022-07-19 10:57:17,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140888608] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:17,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:17,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:17,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338589423] [2022-07-19 10:57:17,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:17,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:17,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:17,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:17,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:17,321 INFO L87 Difference]: Start difference. First operand 1797 states and 2899 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) [2022-07-19 10:57:17,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:17,358 INFO L93 Difference]: Finished difference Result 4233 states and 6869 transitions. [2022-07-19 10:57:17,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:17,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-19 10:57:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:17,366 INFO L225 Difference]: With dead ends: 4233 [2022-07-19 10:57:17,366 INFO L226 Difference]: Without dead ends: 2471 [2022-07-19 10:57:17,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:17,368 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 58 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 190 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 [2022-07-19 10:57:17,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 190 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:17,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2022-07-19 10:57:17,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2469. [2022-07-19 10:57:17,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2468 states have (on average 1.608995137763371) internal successors, (3971), 2468 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:17,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3971 transitions. [2022-07-19 10:57:17,422 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3971 transitions. Word has length 25 [2022-07-19 10:57:17,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:17,422 INFO L495 AbstractCegarLoop]: Abstraction has 2469 states and 3971 transitions. [2022-07-19 10:57:17,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:17,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3971 transitions. [2022-07-19 10:57:17,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 10:57:17,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:17,425 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] [2022-07-19 10:57:17,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 10:57:17,425 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:17,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:17,426 INFO L85 PathProgramCache]: Analyzing trace with hash -608860292, now seen corresponding path program 1 times [2022-07-19 10:57:17,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:17,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627123364] [2022-07-19 10:57:17,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:17,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:17,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:17,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627123364] [2022-07-19 10:57:17,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627123364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:17,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:17,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:17,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842263021] [2022-07-19 10:57:17,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:17,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:17,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:17,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:17,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:17,446 INFO L87 Difference]: Start difference. First operand 2469 states and 3971 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) [2022-07-19 10:57:17,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:17,476 INFO L93 Difference]: Finished difference Result 3705 states and 5941 transitions. [2022-07-19 10:57:17,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:17,477 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 [2022-07-19 10:57:17,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:17,485 INFO L225 Difference]: With dead ends: 3705 [2022-07-19 10:57:17,485 INFO L226 Difference]: Without dead ends: 2503 [2022-07-19 10:57:17,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:17,487 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 60 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 188 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 [2022-07-19 10:57:17,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:17,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2022-07-19 10:57:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2501. [2022-07-19 10:57:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2500 states have (on average 1.5884) internal successors, (3971), 2500 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3971 transitions. [2022-07-19 10:57:17,542 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3971 transitions. Word has length 26 [2022-07-19 10:57:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:17,543 INFO L495 AbstractCegarLoop]: Abstraction has 2501 states and 3971 transitions. [2022-07-19 10:57:17,543 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) [2022-07-19 10:57:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3971 transitions. [2022-07-19 10:57:17,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 10:57:17,545 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:17,545 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] [2022-07-19 10:57:17,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 10:57:17,545 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:17,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:17,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2097759102, now seen corresponding path program 1 times [2022-07-19 10:57:17,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:17,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136350652] [2022-07-19 10:57:17,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:17,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:17,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:17,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136350652] [2022-07-19 10:57:17,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136350652] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:17,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:17,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:17,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134907734] [2022-07-19 10:57:17,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:17,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:17,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:17,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:17,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:17,581 INFO L87 Difference]: Start difference. First operand 2501 states and 3971 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) [2022-07-19 10:57:17,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:17,622 INFO L93 Difference]: Finished difference Result 4489 states and 7269 transitions. [2022-07-19 10:57:17,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:17,623 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 [2022-07-19 10:57:17,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:17,637 INFO L225 Difference]: With dead ends: 4489 [2022-07-19 10:57:17,637 INFO L226 Difference]: Without dead ends: 4487 [2022-07-19 10:57:17,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:17,639 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 45 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 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 [2022-07-19 10:57:17,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:17,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2022-07-19 10:57:17,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 3589. [2022-07-19 10:57:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3589 states, 3588 states have (on average 1.5437569676700111) internal successors, (5539), 3588 states have internal predecessors, (5539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 5539 transitions. [2022-07-19 10:57:17,724 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 5539 transitions. Word has length 26 [2022-07-19 10:57:17,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:17,724 INFO L495 AbstractCegarLoop]: Abstraction has 3589 states and 5539 transitions. [2022-07-19 10:57:17,724 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) [2022-07-19 10:57:17,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 5539 transitions. [2022-07-19 10:57:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 10:57:17,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:17,728 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] [2022-07-19 10:57:17,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 10:57:17,728 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:17,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:17,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1076690748, now seen corresponding path program 1 times [2022-07-19 10:57:17,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:17,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735339047] [2022-07-19 10:57:17,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:17,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:17,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:17,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735339047] [2022-07-19 10:57:17,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735339047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:17,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:17,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:17,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819558683] [2022-07-19 10:57:17,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:17,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:17,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:17,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:17,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:17,747 INFO L87 Difference]: Start difference. First operand 3589 states and 5539 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) [2022-07-19 10:57:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:17,838 INFO L93 Difference]: Finished difference Result 8393 states and 13029 transitions. [2022-07-19 10:57:17,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:17,838 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 [2022-07-19 10:57:17,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:17,867 INFO L225 Difference]: With dead ends: 8393 [2022-07-19 10:57:17,867 INFO L226 Difference]: Without dead ends: 4871 [2022-07-19 10:57:17,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:17,872 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 57 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 191 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 [2022-07-19 10:57:17,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 191 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:17,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2022-07-19 10:57:17,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 4869. [2022-07-19 10:57:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4868 states have (on average 1.538824979457683) internal successors, (7491), 4868 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 7491 transitions. [2022-07-19 10:57:17,982 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 7491 transitions. Word has length 26 [2022-07-19 10:57:17,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:17,983 INFO L495 AbstractCegarLoop]: Abstraction has 4869 states and 7491 transitions. [2022-07-19 10:57:17,983 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) [2022-07-19 10:57:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 7491 transitions. [2022-07-19 10:57:17,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-19 10:57:17,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:17,989 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] [2022-07-19 10:57:17,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 10:57:17,990 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:17,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:17,990 INFO L85 PathProgramCache]: Analyzing trace with hash 606237144, now seen corresponding path program 1 times [2022-07-19 10:57:17,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:17,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767917490] [2022-07-19 10:57:17,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:17,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:18,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:18,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:18,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767917490] [2022-07-19 10:57:18,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767917490] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:18,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:18,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:18,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566630372] [2022-07-19 10:57:18,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:18,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:18,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:18,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:18,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:18,017 INFO L87 Difference]: Start difference. First operand 4869 states and 7491 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) [2022-07-19 10:57:18,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:18,094 INFO L93 Difference]: Finished difference Result 7305 states and 11205 transitions. [2022-07-19 10:57:18,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:18,094 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 [2022-07-19 10:57:18,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:18,102 INFO L225 Difference]: With dead ends: 7305 [2022-07-19 10:57:18,102 INFO L226 Difference]: Without dead ends: 4935 [2022-07-19 10:57:18,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:18,106 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 59 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 184 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 [2022-07-19 10:57:18,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 184 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:18,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4935 states. [2022-07-19 10:57:18,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4935 to 4933. [2022-07-19 10:57:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4933 states, 4932 states have (on average 1.5188564476885644) internal successors, (7491), 4932 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4933 states to 4933 states and 7491 transitions. [2022-07-19 10:57:18,221 INFO L78 Accepts]: Start accepts. Automaton has 4933 states and 7491 transitions. Word has length 27 [2022-07-19 10:57:18,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:18,222 INFO L495 AbstractCegarLoop]: Abstraction has 4933 states and 7491 transitions. [2022-07-19 10:57:18,222 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) [2022-07-19 10:57:18,222 INFO L276 IsEmpty]: Start isEmpty. Operand 4933 states and 7491 transitions. [2022-07-19 10:57:18,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-19 10:57:18,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:18,227 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] [2022-07-19 10:57:18,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 10:57:18,227 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:18,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:18,227 INFO L85 PathProgramCache]: Analyzing trace with hash -982110758, now seen corresponding path program 1 times [2022-07-19 10:57:18,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:18,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354326867] [2022-07-19 10:57:18,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:18,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:18,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:18,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:18,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354326867] [2022-07-19 10:57:18,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354326867] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:18,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:18,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:18,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8885273] [2022-07-19 10:57:18,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:18,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:18,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:18,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:18,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:18,256 INFO L87 Difference]: Start difference. First operand 4933 states and 7491 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) [2022-07-19 10:57:18,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:18,348 INFO L93 Difference]: Finished difference Result 8713 states and 13509 transitions. [2022-07-19 10:57:18,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:18,349 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 [2022-07-19 10:57:18,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:18,364 INFO L225 Difference]: With dead ends: 8713 [2022-07-19 10:57:18,364 INFO L226 Difference]: Without dead ends: 8711 [2022-07-19 10:57:18,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:18,369 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 149 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 [2022-07-19 10:57:18,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:18,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8711 states. [2022-07-19 10:57:18,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8711 to 7173. [2022-07-19 10:57:18,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7173 states, 7172 states have (on average 1.4728109313998885) internal successors, (10563), 7172 states have internal predecessors, (10563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7173 states to 7173 states and 10563 transitions. [2022-07-19 10:57:18,539 INFO L78 Accepts]: Start accepts. Automaton has 7173 states and 10563 transitions. Word has length 27 [2022-07-19 10:57:18,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:18,540 INFO L495 AbstractCegarLoop]: Abstraction has 7173 states and 10563 transitions. [2022-07-19 10:57:18,540 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) [2022-07-19 10:57:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand 7173 states and 10563 transitions. [2022-07-19 10:57:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-19 10:57:18,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:18,548 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] [2022-07-19 10:57:18,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 10:57:18,549 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:18,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:18,549 INFO L85 PathProgramCache]: Analyzing trace with hash -2003179112, now seen corresponding path program 1 times [2022-07-19 10:57:18,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:18,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743988733] [2022-07-19 10:57:18,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:18,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:18,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:18,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:18,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743988733] [2022-07-19 10:57:18,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743988733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:18,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:18,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:18,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128609457] [2022-07-19 10:57:18,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:18,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:18,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:18,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:18,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:18,576 INFO L87 Difference]: Start difference. First operand 7173 states and 10563 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) [2022-07-19 10:57:18,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:18,747 INFO L93 Difference]: Finished difference Result 16649 states and 24645 transitions. [2022-07-19 10:57:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:18,747 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 [2022-07-19 10:57:18,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:18,764 INFO L225 Difference]: With dead ends: 16649 [2022-07-19 10:57:18,764 INFO L226 Difference]: Without dead ends: 9607 [2022-07-19 10:57:18,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:18,772 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 56 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 192 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 [2022-07-19 10:57:18,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 192 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:18,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9607 states. [2022-07-19 10:57:18,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9607 to 9605. [2022-07-19 10:57:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9605 states, 9604 states have (on average 1.4663681799250312) internal successors, (14083), 9604 states have internal predecessors, (14083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9605 states to 9605 states and 14083 transitions. [2022-07-19 10:57:18,992 INFO L78 Accepts]: Start accepts. Automaton has 9605 states and 14083 transitions. Word has length 27 [2022-07-19 10:57:18,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:18,993 INFO L495 AbstractCegarLoop]: Abstraction has 9605 states and 14083 transitions. [2022-07-19 10:57:18,993 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) [2022-07-19 10:57:18,993 INFO L276 IsEmpty]: Start isEmpty. Operand 9605 states and 14083 transitions. [2022-07-19 10:57:19,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 10:57:19,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:19,001 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] [2022-07-19 10:57:19,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 10:57:19,002 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:19,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:19,002 INFO L85 PathProgramCache]: Analyzing trace with hash -380447663, now seen corresponding path program 1 times [2022-07-19 10:57:19,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:19,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344325351] [2022-07-19 10:57:19,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:19,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:19,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:19,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344325351] [2022-07-19 10:57:19,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344325351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:19,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:19,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:19,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803693032] [2022-07-19 10:57:19,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:19,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:19,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:19,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:19,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:19,020 INFO L87 Difference]: Start difference. First operand 9605 states and 14083 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) [2022-07-19 10:57:19,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:19,156 INFO L93 Difference]: Finished difference Result 14409 states and 21061 transitions. [2022-07-19 10:57:19,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:19,157 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 [2022-07-19 10:57:19,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:19,172 INFO L225 Difference]: With dead ends: 14409 [2022-07-19 10:57:19,172 INFO L226 Difference]: Without dead ends: 9735 [2022-07-19 10:57:19,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:19,179 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 58 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 180 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 [2022-07-19 10:57:19,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:19,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9735 states. [2022-07-19 10:57:19,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9735 to 9733. [2022-07-19 10:57:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9733 states, 9732 states have (on average 1.447081792026305) internal successors, (14083), 9732 states have internal predecessors, (14083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:19,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9733 states to 9733 states and 14083 transitions. [2022-07-19 10:57:19,386 INFO L78 Accepts]: Start accepts. Automaton has 9733 states and 14083 transitions. Word has length 28 [2022-07-19 10:57:19,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:19,387 INFO L495 AbstractCegarLoop]: Abstraction has 9733 states and 14083 transitions. [2022-07-19 10:57:19,387 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) [2022-07-19 10:57:19,387 INFO L276 IsEmpty]: Start isEmpty. Operand 9733 states and 14083 transitions. [2022-07-19 10:57:19,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 10:57:19,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:19,396 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] [2022-07-19 10:57:19,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 10:57:19,397 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:19,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:19,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1968795565, now seen corresponding path program 1 times [2022-07-19 10:57:19,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:19,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681937657] [2022-07-19 10:57:19,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:19,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:19,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:19,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681937657] [2022-07-19 10:57:19,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681937657] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:19,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:19,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:19,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559192420] [2022-07-19 10:57:19,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:19,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:19,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:19,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:19,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:19,417 INFO L87 Difference]: Start difference. First operand 9733 states and 14083 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) [2022-07-19 10:57:19,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:19,594 INFO L93 Difference]: Finished difference Result 16905 states and 24965 transitions. [2022-07-19 10:57:19,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:19,595 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 [2022-07-19 10:57:19,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:19,623 INFO L225 Difference]: With dead ends: 16905 [2022-07-19 10:57:19,623 INFO L226 Difference]: Without dead ends: 16903 [2022-07-19 10:57:19,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:19,628 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 39 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 147 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 [2022-07-19 10:57:19,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16903 states. [2022-07-19 10:57:19,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16903 to 14341. [2022-07-19 10:57:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14341 states, 14340 states have (on average 1.4016039051603906) internal successors, (20099), 14340 states have internal predecessors, (20099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14341 states to 14341 states and 20099 transitions. [2022-07-19 10:57:19,937 INFO L78 Accepts]: Start accepts. Automaton has 14341 states and 20099 transitions. Word has length 28 [2022-07-19 10:57:19,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:19,937 INFO L495 AbstractCegarLoop]: Abstraction has 14341 states and 20099 transitions. [2022-07-19 10:57:19,938 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) [2022-07-19 10:57:19,938 INFO L276 IsEmpty]: Start isEmpty. Operand 14341 states and 20099 transitions. [2022-07-19 10:57:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 10:57:19,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:19,954 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] [2022-07-19 10:57:19,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 10:57:19,954 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:19,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:19,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1305103377, now seen corresponding path program 1 times [2022-07-19 10:57:19,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:19,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707039232] [2022-07-19 10:57:19,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:19,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:19,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:19,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707039232] [2022-07-19 10:57:19,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707039232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:19,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:19,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:19,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212404053] [2022-07-19 10:57:19,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:19,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:19,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:19,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:19,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:19,973 INFO L87 Difference]: Start difference. First operand 14341 states and 20099 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) [2022-07-19 10:57:20,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:20,146 INFO L93 Difference]: Finished difference Result 33033 states and 46469 transitions. [2022-07-19 10:57:20,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:20,147 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 [2022-07-19 10:57:20,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:20,182 INFO L225 Difference]: With dead ends: 33033 [2022-07-19 10:57:20,183 INFO L226 Difference]: Without dead ends: 18951 [2022-07-19 10:57:20,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:20,207 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 55 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 193 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 [2022-07-19 10:57:20,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 193 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:20,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18951 states. [2022-07-19 10:57:20,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18951 to 18949. [2022-07-19 10:57:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18949 states, 18948 states have (on average 1.3917563858982478) internal successors, (26371), 18948 states have internal predecessors, (26371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18949 states to 18949 states and 26371 transitions. [2022-07-19 10:57:20,729 INFO L78 Accepts]: Start accepts. Automaton has 18949 states and 26371 transitions. Word has length 28 [2022-07-19 10:57:20,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:20,729 INFO L495 AbstractCegarLoop]: Abstraction has 18949 states and 26371 transitions. [2022-07-19 10:57:20,729 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) [2022-07-19 10:57:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 18949 states and 26371 transitions. [2022-07-19 10:57:20,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 10:57:20,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:20,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:20,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-19 10:57:20,747 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:20,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:20,748 INFO L85 PathProgramCache]: Analyzing trace with hash -902905267, now seen corresponding path program 1 times [2022-07-19 10:57:20,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:20,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709956653] [2022-07-19 10:57:20,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:20,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:20,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:20,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709956653] [2022-07-19 10:57:20,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709956653] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:20,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:20,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:20,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079420908] [2022-07-19 10:57:20,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:20,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:20,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:20,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:20,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:20,780 INFO L87 Difference]: Start difference. First operand 18949 states and 26371 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:20,945 INFO L93 Difference]: Finished difference Result 28425 states and 39429 transitions. [2022-07-19 10:57:20,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:20,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-07-19 10:57:20,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:20,980 INFO L225 Difference]: With dead ends: 28425 [2022-07-19 10:57:20,980 INFO L226 Difference]: Without dead ends: 19207 [2022-07-19 10:57:20,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:20,997 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 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 [2022-07-19 10:57:20,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:21,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19207 states. [2022-07-19 10:57:21,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19207 to 19205. [2022-07-19 10:57:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19205 states, 19204 states have (on average 1.3732034992709852) internal successors, (26371), 19204 states have internal predecessors, (26371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:21,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19205 states to 19205 states and 26371 transitions. [2022-07-19 10:57:21,422 INFO L78 Accepts]: Start accepts. Automaton has 19205 states and 26371 transitions. Word has length 29 [2022-07-19 10:57:21,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:21,423 INFO L495 AbstractCegarLoop]: Abstraction has 19205 states and 26371 transitions. [2022-07-19 10:57:21,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:21,423 INFO L276 IsEmpty]: Start isEmpty. Operand 19205 states and 26371 transitions. [2022-07-19 10:57:21,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 10:57:21,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:21,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:21,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 10:57:21,440 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:21,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:21,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1803714127, now seen corresponding path program 1 times [2022-07-19 10:57:21,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:21,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303044177] [2022-07-19 10:57:21,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:21,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:21,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:21,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303044177] [2022-07-19 10:57:21,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303044177] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:21,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:21,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:21,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941145959] [2022-07-19 10:57:21,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:21,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:21,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:21,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:21,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:21,458 INFO L87 Difference]: Start difference. First operand 19205 states and 26371 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:21,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:21,753 INFO L93 Difference]: Finished difference Result 32777 states and 45829 transitions. [2022-07-19 10:57:21,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:21,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-07-19 10:57:21,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:21,810 INFO L225 Difference]: With dead ends: 32777 [2022-07-19 10:57:21,810 INFO L226 Difference]: Without dead ends: 32775 [2022-07-19 10:57:21,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:21,816 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 36 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 145 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 [2022-07-19 10:57:21,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:21,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32775 states. [2022-07-19 10:57:22,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32775 to 28677. [2022-07-19 10:57:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28677 states, 28676 states have (on average 1.3302761891477193) internal successors, (38147), 28676 states have internal predecessors, (38147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28677 states to 28677 states and 38147 transitions. [2022-07-19 10:57:22,365 INFO L78 Accepts]: Start accepts. Automaton has 28677 states and 38147 transitions. Word has length 29 [2022-07-19 10:57:22,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:22,366 INFO L495 AbstractCegarLoop]: Abstraction has 28677 states and 38147 transitions. [2022-07-19 10:57:22,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:22,366 INFO L276 IsEmpty]: Start isEmpty. Operand 28677 states and 38147 transitions. [2022-07-19 10:57:22,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 10:57:22,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:22,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:22,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-19 10:57:22,398 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:22,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:22,399 INFO L85 PathProgramCache]: Analyzing trace with hash 782645773, now seen corresponding path program 1 times [2022-07-19 10:57:22,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:22,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681964964] [2022-07-19 10:57:22,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:22,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:22,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:22,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681964964] [2022-07-19 10:57:22,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681964964] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:22,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:22,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:22,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641691089] [2022-07-19 10:57:22,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:22,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:22,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:22,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:22,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:22,414 INFO L87 Difference]: Start difference. First operand 28677 states and 38147 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:22,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:22,711 INFO L93 Difference]: Finished difference Result 65545 states and 87301 transitions. [2022-07-19 10:57:22,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:22,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-07-19 10:57:22,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:22,774 INFO L225 Difference]: With dead ends: 65545 [2022-07-19 10:57:22,774 INFO L226 Difference]: Without dead ends: 37383 [2022-07-19 10:57:22,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:22,810 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 54 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 194 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 [2022-07-19 10:57:22,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 194 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:22,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37383 states. [2022-07-19 10:57:23,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37383 to 37381. [2022-07-19 10:57:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37381 states, 37380 states have (on average 1.315008025682183) internal successors, (49155), 37380 states have internal predecessors, (49155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37381 states to 37381 states and 49155 transitions. [2022-07-19 10:57:23,681 INFO L78 Accepts]: Start accepts. Automaton has 37381 states and 49155 transitions. Word has length 29 [2022-07-19 10:57:23,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:23,681 INFO L495 AbstractCegarLoop]: Abstraction has 37381 states and 49155 transitions. [2022-07-19 10:57:23,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:23,682 INFO L276 IsEmpty]: Start isEmpty. Operand 37381 states and 49155 transitions. [2022-07-19 10:57:23,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 10:57:23,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:23,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:23,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-19 10:57:23,706 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:23,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:23,707 INFO L85 PathProgramCache]: Analyzing trace with hash 80778534, now seen corresponding path program 1 times [2022-07-19 10:57:23,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:23,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551485266] [2022-07-19 10:57:23,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:23,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:23,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:23,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:23,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551485266] [2022-07-19 10:57:23,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551485266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:23,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:23,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:23,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659923962] [2022-07-19 10:57:23,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:23,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:23,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:23,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:23,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:23,725 INFO L87 Difference]: Start difference. First operand 37381 states and 49155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:24,149 INFO L93 Difference]: Finished difference Result 56073 states and 73477 transitions. [2022-07-19 10:57:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:24,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-07-19 10:57:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:24,210 INFO L225 Difference]: With dead ends: 56073 [2022-07-19 10:57:24,211 INFO L226 Difference]: Without dead ends: 37895 [2022-07-19 10:57:24,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:24,229 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 56 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 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 [2022-07-19 10:57:24,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:24,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37895 states. [2022-07-19 10:57:24,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37895 to 37893. [2022-07-19 10:57:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37893 states, 37892 states have (on average 1.2972395228544285) internal successors, (49155), 37892 states have internal predecessors, (49155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37893 states to 37893 states and 49155 transitions. [2022-07-19 10:57:24,814 INFO L78 Accepts]: Start accepts. Automaton has 37893 states and 49155 transitions. Word has length 30 [2022-07-19 10:57:24,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:24,815 INFO L495 AbstractCegarLoop]: Abstraction has 37893 states and 49155 transitions. [2022-07-19 10:57:24,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:24,815 INFO L276 IsEmpty]: Start isEmpty. Operand 37893 states and 49155 transitions. [2022-07-19 10:57:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 10:57:24,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:24,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:24,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-19 10:57:24,946 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:24,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:24,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1507569368, now seen corresponding path program 1 times [2022-07-19 10:57:24,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:24,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104119274] [2022-07-19 10:57:24,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:24,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:24,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:24,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:24,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104119274] [2022-07-19 10:57:24,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104119274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:24,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:24,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:24,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452540090] [2022-07-19 10:57:24,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:24,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:24,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:24,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:24,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:24,966 INFO L87 Difference]: Start difference. First operand 37893 states and 49155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:25,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:25,611 INFO L93 Difference]: Finished difference Result 110601 states and 141317 transitions. [2022-07-19 10:57:25,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:25,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-07-19 10:57:25,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:25,693 INFO L225 Difference]: With dead ends: 110601 [2022-07-19 10:57:25,694 INFO L226 Difference]: Without dead ends: 73735 [2022-07-19 10:57:25,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:25,724 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 54 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 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 [2022-07-19 10:57:25,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:25,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73735 states. [2022-07-19 10:57:26,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73735 to 73733. [2022-07-19 10:57:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73733 states, 73732 states have (on average 1.2499728747355288) internal successors, (92163), 73732 states have internal predecessors, (92163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73733 states to 73733 states and 92163 transitions. [2022-07-19 10:57:26,816 INFO L78 Accepts]: Start accepts. Automaton has 73733 states and 92163 transitions. Word has length 30 [2022-07-19 10:57:26,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:26,816 INFO L495 AbstractCegarLoop]: Abstraction has 73733 states and 92163 transitions. [2022-07-19 10:57:26,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 73733 states and 92163 transitions. [2022-07-19 10:57:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 10:57:26,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:26,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:26,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-19 10:57:26,855 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:26,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:26,856 INFO L85 PathProgramCache]: Analyzing trace with hash -486501014, now seen corresponding path program 1 times [2022-07-19 10:57:26,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:26,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405514371] [2022-07-19 10:57:26,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:26,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:26,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:26,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:26,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405514371] [2022-07-19 10:57:26,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405514371] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:26,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:26,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:26,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693707183] [2022-07-19 10:57:26,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:26,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:26,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:26,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:26,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:26,878 INFO L87 Difference]: Start difference. First operand 73733 states and 92163 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:27,617 INFO L93 Difference]: Finished difference Result 79881 states and 102405 transitions. [2022-07-19 10:57:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:27,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-07-19 10:57:27,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:27,806 INFO L225 Difference]: With dead ends: 79881 [2022-07-19 10:57:27,806 INFO L226 Difference]: Without dead ends: 79879 [2022-07-19 10:57:27,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:27,819 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 33 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 184 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 [2022-07-19 10:57:27,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 184 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:27,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79879 states. [2022-07-19 10:57:28,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79879 to 73733. [2022-07-19 10:57:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73733 states, 73732 states have (on average 1.2360847393262084) internal successors, (91139), 73732 states have internal predecessors, (91139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73733 states to 73733 states and 91139 transitions. [2022-07-19 10:57:28,829 INFO L78 Accepts]: Start accepts. Automaton has 73733 states and 91139 transitions. Word has length 30 [2022-07-19 10:57:28,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:28,830 INFO L495 AbstractCegarLoop]: Abstraction has 73733 states and 91139 transitions. [2022-07-19 10:57:28,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:28,830 INFO L276 IsEmpty]: Start isEmpty. Operand 73733 states and 91139 transitions. [2022-07-19 10:57:28,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 10:57:28,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:28,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:28,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-19 10:57:28,864 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:28,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:28,865 INFO L85 PathProgramCache]: Analyzing trace with hash 510205634, now seen corresponding path program 1 times [2022-07-19 10:57:28,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:28,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689276934] [2022-07-19 10:57:28,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:28,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:28,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:28,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689276934] [2022-07-19 10:57:28,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689276934] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:28,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:28,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:28,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44486918] [2022-07-19 10:57:28,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:28,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:28,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:28,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:28,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:28,888 INFO L87 Difference]: Start difference. First operand 73733 states and 91139 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:30,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:30,049 INFO L93 Difference]: Finished difference Result 121865 states and 151557 transitions. [2022-07-19 10:57:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:30,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-07-19 10:57:30,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:30,180 INFO L225 Difference]: With dead ends: 121865 [2022-07-19 10:57:30,180 INFO L226 Difference]: Without dead ends: 121863 [2022-07-19 10:57:30,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:30,201 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 30 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 141 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 [2022-07-19 10:57:30,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 141 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:30,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121863 states. [2022-07-19 10:57:31,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121863 to 113669. [2022-07-19 10:57:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113669 states, 113668 states have (on average 1.2071911179927508) internal successors, (137219), 113668 states have internal predecessors, (137219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113669 states to 113669 states and 137219 transitions. [2022-07-19 10:57:31,840 INFO L78 Accepts]: Start accepts. Automaton has 113669 states and 137219 transitions. Word has length 31 [2022-07-19 10:57:31,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:31,841 INFO L495 AbstractCegarLoop]: Abstraction has 113669 states and 137219 transitions. [2022-07-19 10:57:31,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 113669 states and 137219 transitions. [2022-07-19 10:57:31,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 10:57:31,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:31,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:31,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-19 10:57:31,908 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:31,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:31,908 INFO L85 PathProgramCache]: Analyzing trace with hash -510862720, now seen corresponding path program 1 times [2022-07-19 10:57:31,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:31,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62170444] [2022-07-19 10:57:31,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:31,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:31,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:31,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:31,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62170444] [2022-07-19 10:57:31,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62170444] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:31,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:31,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:31,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960001416] [2022-07-19 10:57:31,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:31,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:31,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:31,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:31,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:31,926 INFO L87 Difference]: Start difference. First operand 113669 states and 137219 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:33,325 INFO L93 Difference]: Finished difference Result 257033 states and 309253 transitions. [2022-07-19 10:57:33,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:33,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-07-19 10:57:33,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:33,480 INFO L225 Difference]: With dead ends: 257033 [2022-07-19 10:57:33,480 INFO L226 Difference]: Without dead ends: 144391 [2022-07-19 10:57:33,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:33,554 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 52 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 196 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 [2022-07-19 10:57:33,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 196 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144391 states. [2022-07-19 10:57:35,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144391 to 144389. [2022-07-19 10:57:35,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144389 states, 144388 states have (on average 1.177293126852647) internal successors, (169987), 144388 states have internal predecessors, (169987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144389 states to 144389 states and 169987 transitions. [2022-07-19 10:57:36,053 INFO L78 Accepts]: Start accepts. Automaton has 144389 states and 169987 transitions. Word has length 31 [2022-07-19 10:57:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:36,053 INFO L495 AbstractCegarLoop]: Abstraction has 144389 states and 169987 transitions. [2022-07-19 10:57:36,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 144389 states and 169987 transitions. [2022-07-19 10:57:36,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 10:57:36,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:36,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:36,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-19 10:57:36,123 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:36,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:36,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1363278403, now seen corresponding path program 1 times [2022-07-19 10:57:36,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:36,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527339088] [2022-07-19 10:57:36,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:36,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:36,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:36,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:36,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527339088] [2022-07-19 10:57:36,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527339088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:36,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:36,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:36,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519655750] [2022-07-19 10:57:36,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:36,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:36,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:36,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:36,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:36,140 INFO L87 Difference]: Start difference. First operand 144389 states and 169987 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:37,447 INFO L93 Difference]: Finished difference Result 218121 states and 257029 transitions. [2022-07-19 10:57:37,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:37,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-07-19 10:57:37,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:37,612 INFO L225 Difference]: With dead ends: 218121 [2022-07-19 10:57:37,612 INFO L226 Difference]: Without dead ends: 147463 [2022-07-19 10:57:37,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:37,671 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 54 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 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 [2022-07-19 10:57:37,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:37,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147463 states. [2022-07-19 10:57:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147463 to 147461. [2022-07-19 10:57:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147461 states, 147460 states have (on average 1.1666553641665536) internal successors, (172035), 147460 states have internal predecessors, (172035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:40,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147461 states to 147461 states and 172035 transitions. [2022-07-19 10:57:40,132 INFO L78 Accepts]: Start accepts. Automaton has 147461 states and 172035 transitions. Word has length 32 [2022-07-19 10:57:40,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:40,133 INFO L495 AbstractCegarLoop]: Abstraction has 147461 states and 172035 transitions. [2022-07-19 10:57:40,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:40,133 INFO L276 IsEmpty]: Start isEmpty. Operand 147461 states and 172035 transitions. [2022-07-19 10:57:40,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 10:57:40,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:40,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:40,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-19 10:57:40,201 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:40,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:40,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1343340991, now seen corresponding path program 1 times [2022-07-19 10:57:40,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:40,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117886359] [2022-07-19 10:57:40,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:40,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:40,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:40,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117886359] [2022-07-19 10:57:40,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117886359] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:40,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:40,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:40,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102038588] [2022-07-19 10:57:40,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:40,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:40,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:40,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:40,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:40,220 INFO L87 Difference]: Start difference. First operand 147461 states and 172035 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:42,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:42,344 INFO L93 Difference]: Finished difference Result 237575 states and 274436 transitions. [2022-07-19 10:57:42,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:42,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-07-19 10:57:42,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:42,651 INFO L225 Difference]: With dead ends: 237575 [2022-07-19 10:57:42,651 INFO L226 Difference]: Without dead ends: 237573 [2022-07-19 10:57:42,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:42,692 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 138 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 [2022-07-19 10:57:42,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 138 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237573 states. [2022-07-19 10:57:45,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237573 to 229381. [2022-07-19 10:57:45,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229381 states, 229380 states have (on average 1.1428502920917256) internal successors, (262147), 229380 states have internal predecessors, (262147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229381 states to 229381 states and 262147 transitions. [2022-07-19 10:57:46,199 INFO L78 Accepts]: Start accepts. Automaton has 229381 states and 262147 transitions. Word has length 32 [2022-07-19 10:57:46,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:46,199 INFO L495 AbstractCegarLoop]: Abstraction has 229381 states and 262147 transitions. [2022-07-19 10:57:46,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 229381 states and 262147 transitions. [2022-07-19 10:57:46,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 10:57:46,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:46,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:46,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-19 10:57:46,382 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:46,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:46,382 INFO L85 PathProgramCache]: Analyzing trace with hash 322272637, now seen corresponding path program 1 times [2022-07-19 10:57:46,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:46,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246852461] [2022-07-19 10:57:46,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:46,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:46,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:46,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246852461] [2022-07-19 10:57:46,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246852461] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:46,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:46,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:46,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111829935] [2022-07-19 10:57:46,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:46,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:46,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:46,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:46,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:46,397 INFO L87 Difference]: Start difference. First operand 229381 states and 262147 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:48,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:48,845 INFO L93 Difference]: Finished difference Result 512005 states and 577539 transitions. [2022-07-19 10:57:48,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:48,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-07-19 10:57:48,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:48,846 INFO L225 Difference]: With dead ends: 512005 [2022-07-19 10:57:48,846 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 10:57:48,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:48,997 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 50 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 195 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 [2022-07-19 10:57:48,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 195 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:48,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 10:57:48,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 10:57:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 10:57:48,998 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2022-07-19 10:57:48,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:48,999 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 10:57:48,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:48,999 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 10:57:48,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 10:57:49,001 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 10:57:49,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-19 10:57:49,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 10:57:49,021 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 54) no Hoare annotation was computed. [2022-07-19 10:57:49,021 INFO L899 garLoopResultBuilder]: For program point L168(line 168) no Hoare annotation was computed. [2022-07-19 10:57:49,022 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 10:57:49,022 INFO L899 garLoopResultBuilder]: For program point L152-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,022 INFO L899 garLoopResultBuilder]: For program point L119-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,022 INFO L899 garLoopResultBuilder]: For program point L103-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,022 INFO L899 garLoopResultBuilder]: For program point L153(line 153) no Hoare annotation was computed. [2022-07-19 10:57:49,022 INFO L899 garLoopResultBuilder]: For program point L87-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,022 INFO L902 garLoopResultBuilder]: At program point L203(lines 7 207) the Hoare annotation is: true [2022-07-19 10:57:49,022 INFO L899 garLoopResultBuilder]: For program point L137-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,023 INFO L899 garLoopResultBuilder]: For program point L187-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,023 INFO L899 garLoopResultBuilder]: For program point L138(line 138) no Hoare annotation was computed. [2022-07-19 10:57:49,023 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-07-19 10:57:49,023 INFO L899 garLoopResultBuilder]: For program point L172-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,023 INFO L899 garLoopResultBuilder]: For program point L123-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,023 INFO L902 garLoopResultBuilder]: At program point L206(lines 6 207) the Hoare annotation is: true [2022-07-19 10:57:49,023 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-07-19 10:57:49,024 INFO L899 garLoopResultBuilder]: For program point L107-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,024 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 10:57:49,024 INFO L899 garLoopResultBuilder]: For program point L157-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,024 INFO L899 garLoopResultBuilder]: For program point L91-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,024 INFO L899 garLoopResultBuilder]: For program point L158(line 158) no Hoare annotation was computed. [2022-07-19 10:57:49,024 INFO L899 garLoopResultBuilder]: For program point L142-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,024 INFO L899 garLoopResultBuilder]: For program point L192-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,024 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-07-19 10:57:49,025 INFO L899 garLoopResultBuilder]: For program point L193(line 193) no Hoare annotation was computed. [2022-07-19 10:57:49,025 INFO L899 garLoopResultBuilder]: For program point L127-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,025 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 10:57:49,025 INFO L899 garLoopResultBuilder]: For program point L177-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,025 INFO L899 garLoopResultBuilder]: For program point L111-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,025 INFO L899 garLoopResultBuilder]: For program point L95-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,025 INFO L899 garLoopResultBuilder]: For program point L178(line 178) no Hoare annotation was computed. [2022-07-19 10:57:49,025 INFO L899 garLoopResultBuilder]: For program point L162-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,026 INFO L899 garLoopResultBuilder]: For program point L163(line 163) no Hoare annotation was computed. [2022-07-19 10:57:49,026 INFO L899 garLoopResultBuilder]: For program point L147-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,026 INFO L902 garLoopResultBuilder]: At program point L197-1(lines 50 202) the Hoare annotation is: true [2022-07-19 10:57:49,026 INFO L899 garLoopResultBuilder]: For program point L131-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,026 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 10:57:49,026 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 205) no Hoare annotation was computed. [2022-07-19 10:57:49,026 INFO L899 garLoopResultBuilder]: For program point L148(line 148) no Hoare annotation was computed. [2022-07-19 10:57:49,027 INFO L899 garLoopResultBuilder]: For program point L115-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,027 INFO L899 garLoopResultBuilder]: For program point L198(line 198) no Hoare annotation was computed. [2022-07-19 10:57:49,027 INFO L895 garLoopResultBuilder]: At program point L198-1(lines 7 207) the Hoare annotation is: false [2022-07-19 10:57:49,027 INFO L899 garLoopResultBuilder]: For program point L99-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,027 INFO L899 garLoopResultBuilder]: For program point L182-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,027 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 85) no Hoare annotation was computed. [2022-07-19 10:57:49,027 INFO L899 garLoopResultBuilder]: For program point L83-2(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,027 INFO L899 garLoopResultBuilder]: For program point L183(line 183) no Hoare annotation was computed. [2022-07-19 10:57:49,028 INFO L899 garLoopResultBuilder]: For program point L167-1(lines 50 202) no Hoare annotation was computed. [2022-07-19 10:57:49,031 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:49,032 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 10:57:49,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:57:49 BoogieIcfgContainer [2022-07-19 10:57:49,039 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 10:57:49,040 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 10:57:49,040 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 10:57:49,040 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 10:57:49,041 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:57:15" (3/4) ... [2022-07-19 10:57:49,043 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 10:57:49,053 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-19 10:57:49,053 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-19 10:57:49,053 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 10:57:49,054 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 10:57:49,100 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 10:57:49,100 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 10:57:49,103 INFO L158 Benchmark]: Toolchain (without parser) took 34299.11ms. Allocated memory was 90.2MB in the beginning and 14.7GB in the end (delta: 14.6GB). Free memory was 58.0MB in the beginning and 11.3GB in the end (delta: -11.2GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2022-07-19 10:57:49,103 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 90.2MB. Free memory is still 44.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:57:49,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.75ms. Allocated memory is still 90.2MB. Free memory was 57.8MB in the beginning and 64.5MB in the end (delta: -6.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 10:57:49,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.34ms. Allocated memory is still 90.2MB. Free memory was 64.5MB in the beginning and 62.5MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 10:57:49,109 INFO L158 Benchmark]: Boogie Preprocessor took 40.79ms. Allocated memory is still 90.2MB. Free memory was 62.5MB in the beginning and 61.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:57:49,109 INFO L158 Benchmark]: RCFGBuilder took 367.06ms. Allocated memory is still 90.2MB. Free memory was 61.1MB in the beginning and 47.2MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-19 10:57:49,109 INFO L158 Benchmark]: TraceAbstraction took 33513.33ms. Allocated memory was 90.2MB in the beginning and 14.7GB in the end (delta: 14.6GB). Free memory was 46.6MB in the beginning and 11.3GB in the end (delta: -11.3GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2022-07-19 10:57:49,109 INFO L158 Benchmark]: Witness Printer took 60.40ms. Allocated memory is still 14.7GB. Free memory was 11.3GB in the beginning and 11.3GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 10:57:49,112 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.11ms. Allocated memory is still 90.2MB. Free memory is still 44.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.75ms. Allocated memory is still 90.2MB. Free memory was 57.8MB in the beginning and 64.5MB in the end (delta: -6.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.34ms. Allocated memory is still 90.2MB. Free memory was 64.5MB in the beginning and 62.5MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.79ms. Allocated memory is still 90.2MB. Free memory was 62.5MB in the beginning and 61.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 367.06ms. Allocated memory is still 90.2MB. Free memory was 61.1MB in the beginning and 47.2MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 33513.33ms. Allocated memory was 90.2MB in the beginning and 14.7GB in the end (delta: 14.6GB). Free memory was 46.6MB in the beginning and 11.3GB in the end (delta: -11.3GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. * Witness Printer took 60.40ms. Allocated memory is still 14.7GB. Free memory was 11.3GB in the beginning and 11.3GB 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: 205]: 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, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.4s, OverallIterations: 36, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.8s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1926 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1926 mSDsluCounter, 6369 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2568 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 191 IncrementalHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 3801 mSDtfsCounter, 191 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229381occurred in iteration=35, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 32806 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 8201 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 940 NumberOfCodeBlocks, 940 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 1996 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-19 10:57:49,153 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