./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 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_9.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 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:26:37,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:26:37,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:26:37,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:26:37,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:26:37,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:26:37,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:26:37,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:26:37,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:26:37,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:26:37,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:26:37,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:26:37,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:26:37,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:26:37,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:26:37,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:26:37,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:26:37,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:26:37,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:26:37,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:26:37,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:26:37,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:26:37,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:26:37,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:26:37,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:26:37,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:26:37,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:26:37,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:26:37,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:26:37,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:26:37,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:26:37,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:26:37,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:26:37,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:26:37,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:26:37,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:26:37,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:26:37,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:26:37,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:26:37,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:26:37,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:26:37,629 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:26:37,657 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:26:37,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:26:37,657 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:26:37,658 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:26:37,658 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:26:37,658 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:26:37,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:26:37,659 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:26:37,659 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:26:37,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:26:37,660 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:26:37,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:26:37,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:26:37,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:26:37,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:26:37,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:26:37,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:26:37,660 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:26:37,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:26:37,660 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:26:37,660 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:26:37,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:26:37,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:26:37,661 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:26:37,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:26:37,661 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:26:37,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:26:37,661 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:26:37,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:26:37,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:26:37,661 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:26:37,662 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:26:37,662 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:26:37,662 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:26:37,662 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:26:37,662 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2023-02-15 10:26:37,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:26:37,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:26:37,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:26:37,904 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:26:37,904 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:26:37,905 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2023-02-15 10:26:38,856 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:26:39,022 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:26:39,022 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2023-02-15 10:26:39,027 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce748ada/a3f1d6165aad44b6b80cf260d19bb3db/FLAG3bca3113c [2023-02-15 10:26:39,036 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce748ada/a3f1d6165aad44b6b80cf260d19bb3db [2023-02-15 10:26:39,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:26:39,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:26:39,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:26:39,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:26:39,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:26:39,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:26:39" (1/1) ... [2023-02-15 10:26:39,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540e8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:26:39, skipping insertion in model container [2023-02-15 10:26:39,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:26:39" (1/1) ... [2023-02-15 10:26:39,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:26:39,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:26:39,216 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2023-02-15 10:26:39,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:26:39,240 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:26:39,272 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2023-02-15 10:26:39,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:26:39,285 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:26:39,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:26:39 WrapperNode [2023-02-15 10:26:39,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:26:39,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:26:39,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:26:39,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:26:39,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:26:39" (1/1) ... [2023-02-15 10:26:39,302 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:26:39" (1/1) ... [2023-02-15 10:26:39,315 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 127 [2023-02-15 10:26:39,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:26:39,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:26:39,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:26:39,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:26:39,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:26:39" (1/1) ... [2023-02-15 10:26:39,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:26:39" (1/1) ... [2023-02-15 10:26:39,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:26:39" (1/1) ... [2023-02-15 10:26:39,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:26:39" (1/1) ... [2023-02-15 10:26:39,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:26:39" (1/1) ... [2023-02-15 10:26:39,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:26:39" (1/1) ... [2023-02-15 10:26:39,330 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:26:39" (1/1) ... [2023-02-15 10:26:39,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:26:39" (1/1) ... [2023-02-15 10:26:39,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:26:39,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:26:39,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:26:39,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:26:39,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:26:39" (1/1) ... [2023-02-15 10:26:39,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:26:39,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:26:39,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:26:39,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:26:39,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:26:39,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:26:39,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:26:39,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:26:39,445 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:26:39,447 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:26:39,577 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:26:39,581 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:26:39,581 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 10:26:39,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:26:39 BoogieIcfgContainer [2023-02-15 10:26:39,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:26:39,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:26:39,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:26:39,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:26:39,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:26:39" (1/3) ... [2023-02-15 10:26:39,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d148ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:26:39, skipping insertion in model container [2023-02-15 10:26:39,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:26:39" (2/3) ... [2023-02-15 10:26:39,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d148ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:26:39, skipping insertion in model container [2023-02-15 10:26:39,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:26:39" (3/3) ... [2023-02-15 10:26:39,605 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2023-02-15 10:26:39,626 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:26:39,626 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:26:39,703 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:26:39,707 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@672110d9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:26:39,708 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:26:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:39,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 10:26:39,716 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:39,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:39,716 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:39,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:39,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1657621241, now seen corresponding path program 1 times [2023-02-15 10:26:39,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:39,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604029009] [2023-02-15 10:26:39,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:39,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:39,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:39,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604029009] [2023-02-15 10:26:39,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604029009] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:39,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:39,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:39,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727814783] [2023-02-15 10:26:39,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:39,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:39,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:39,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:39,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:39,915 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 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 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:39,953 INFO L93 Difference]: Finished difference Result 77 states and 133 transitions. [2023-02-15 10:26:39,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:39,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-02-15 10:26:39,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:39,963 INFO L225 Difference]: With dead ends: 77 [2023-02-15 10:26:39,963 INFO L226 Difference]: Without dead ends: 63 [2023-02-15 10:26:39,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:39,969 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:39,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 127 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:39,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-15 10:26:39,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 43. [2023-02-15 10:26:39,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 78 transitions. [2023-02-15 10:26:40,001 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 78 transitions. Word has length 16 [2023-02-15 10:26:40,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:40,004 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 78 transitions. [2023-02-15 10:26:40,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,005 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 78 transitions. [2023-02-15 10:26:40,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 10:26:40,006 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:40,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:40,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:26:40,007 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:40,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:40,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1399455803, now seen corresponding path program 1 times [2023-02-15 10:26:40,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:40,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439060611] [2023-02-15 10:26:40,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:40,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:40,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:40,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439060611] [2023-02-15 10:26:40,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439060611] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:40,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:40,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:40,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972984103] [2023-02-15 10:26:40,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:40,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:40,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:40,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:40,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,063 INFO L87 Difference]: Start difference. First operand 43 states and 78 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:40,077 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2023-02-15 10:26:40,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:40,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-02-15 10:26:40,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:40,078 INFO L225 Difference]: With dead ends: 104 [2023-02-15 10:26:40,079 INFO L226 Difference]: Without dead ends: 63 [2023-02-15 10:26:40,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,080 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:40,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 129 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:40,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-15 10:26:40,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2023-02-15 10:26:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 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) [2023-02-15 10:26:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 110 transitions. [2023-02-15 10:26:40,085 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 110 transitions. Word has length 16 [2023-02-15 10:26:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:40,086 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 110 transitions. [2023-02-15 10:26:40,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 110 transitions. [2023-02-15 10:26:40,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 10:26:40,086 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:40,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:40,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:26:40,087 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:40,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:40,088 INFO L85 PathProgramCache]: Analyzing trace with hash 153562753, now seen corresponding path program 1 times [2023-02-15 10:26:40,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:40,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209663586] [2023-02-15 10:26:40,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:40,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:40,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:40,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:40,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209663586] [2023-02-15 10:26:40,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209663586] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:40,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:40,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:40,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957789632] [2023-02-15 10:26:40,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:40,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:40,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:40,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:40,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,123 INFO L87 Difference]: Start difference. First operand 61 states and 110 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:40,139 INFO L93 Difference]: Finished difference Result 96 states and 168 transitions. [2023-02-15 10:26:40,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:40,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2023-02-15 10:26:40,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:40,140 INFO L225 Difference]: With dead ends: 96 [2023-02-15 10:26:40,140 INFO L226 Difference]: Without dead ends: 66 [2023-02-15 10:26:40,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,142 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 45 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:40,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:40,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-15 10:26:40,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2023-02-15 10:26:40,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions. [2023-02-15 10:26:40,147 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 17 [2023-02-15 10:26:40,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:40,148 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 112 transitions. [2023-02-15 10:26:40,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,148 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 112 transitions. [2023-02-15 10:26:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 10:26:40,149 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:40,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:40,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 10:26:40,149 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:40,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:40,150 INFO L85 PathProgramCache]: Analyzing trace with hash -433243261, now seen corresponding path program 1 times [2023-02-15 10:26:40,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:40,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465036033] [2023-02-15 10:26:40,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:40,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:40,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:40,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:40,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465036033] [2023-02-15 10:26:40,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465036033] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:40,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:40,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:40,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499014716] [2023-02-15 10:26:40,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:40,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:40,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:40,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:40,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,188 INFO L87 Difference]: Start difference. First operand 64 states and 112 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:40,199 INFO L93 Difference]: Finished difference Result 121 states and 213 transitions. [2023-02-15 10:26:40,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:40,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2023-02-15 10:26:40,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:40,200 INFO L225 Difference]: With dead ends: 121 [2023-02-15 10:26:40,201 INFO L226 Difference]: Without dead ends: 119 [2023-02-15 10:26:40,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,202 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 40 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:40,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:40,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-15 10:26:40,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 85. [2023-02-15 10:26:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 149 transitions. [2023-02-15 10:26:40,209 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 149 transitions. Word has length 17 [2023-02-15 10:26:40,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:40,209 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 149 transitions. [2023-02-15 10:26:40,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,209 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 149 transitions. [2023-02-15 10:26:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 10:26:40,210 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:40,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:40,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 10:26:40,211 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:40,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:40,211 INFO L85 PathProgramCache]: Analyzing trace with hash -175077823, now seen corresponding path program 1 times [2023-02-15 10:26:40,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:40,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867219709] [2023-02-15 10:26:40,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:40,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:40,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:40,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:40,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867219709] [2023-02-15 10:26:40,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867219709] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:40,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:40,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:40,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61687058] [2023-02-15 10:26:40,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:40,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:40,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:40,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:40,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,255 INFO L87 Difference]: Start difference. First operand 85 states and 149 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:40,265 INFO L93 Difference]: Finished difference Result 201 states and 355 transitions. [2023-02-15 10:26:40,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:40,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2023-02-15 10:26:40,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:40,267 INFO L225 Difference]: With dead ends: 201 [2023-02-15 10:26:40,267 INFO L226 Difference]: Without dead ends: 121 [2023-02-15 10:26:40,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,268 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:40,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 130 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:40,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-15 10:26:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2023-02-15 10:26:40,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 207 transitions. [2023-02-15 10:26:40,276 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 207 transitions. Word has length 17 [2023-02-15 10:26:40,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:40,276 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 207 transitions. [2023-02-15 10:26:40,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,277 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 207 transitions. [2023-02-15 10:26:40,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 10:26:40,277 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:40,277 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:40,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 10:26:40,277 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:40,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:40,278 INFO L85 PathProgramCache]: Analyzing trace with hash -545425190, now seen corresponding path program 1 times [2023-02-15 10:26:40,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:40,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245842938] [2023-02-15 10:26:40,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:40,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:40,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:40,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245842938] [2023-02-15 10:26:40,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245842938] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:40,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:40,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:40,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779122399] [2023-02-15 10:26:40,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:40,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:40,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:40,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:40,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,320 INFO L87 Difference]: Start difference. First operand 119 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:40,330 INFO L93 Difference]: Finished difference Result 180 states and 310 transitions. [2023-02-15 10:26:40,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:40,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 10:26:40,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:40,331 INFO L225 Difference]: With dead ends: 180 [2023-02-15 10:26:40,331 INFO L226 Difference]: Without dead ends: 123 [2023-02-15 10:26:40,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,333 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 44 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:40,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:40,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-15 10:26:40,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2023-02-15 10:26:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 207 transitions. [2023-02-15 10:26:40,349 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 207 transitions. Word has length 18 [2023-02-15 10:26:40,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:40,349 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 207 transitions. [2023-02-15 10:26:40,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,350 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 207 transitions. [2023-02-15 10:26:40,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 10:26:40,352 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:40,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:40,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 10:26:40,353 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:40,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:40,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1132231204, now seen corresponding path program 1 times [2023-02-15 10:26:40,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:40,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401321745] [2023-02-15 10:26:40,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:40,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:40,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:40,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401321745] [2023-02-15 10:26:40,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401321745] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:40,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:40,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:40,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741408642] [2023-02-15 10:26:40,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:40,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:40,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:40,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:40,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,380 INFO L87 Difference]: Start difference. First operand 121 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:40,394 INFO L93 Difference]: Finished difference Result 345 states and 593 transitions. [2023-02-15 10:26:40,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:40,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 10:26:40,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:40,396 INFO L225 Difference]: With dead ends: 345 [2023-02-15 10:26:40,396 INFO L226 Difference]: Without dead ends: 231 [2023-02-15 10:26:40,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,398 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:40,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 115 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:40,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-02-15 10:26:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2023-02-15 10:26:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6973684210526316) internal successors, (387), 228 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 387 transitions. [2023-02-15 10:26:40,408 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 387 transitions. Word has length 18 [2023-02-15 10:26:40,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:40,408 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 387 transitions. [2023-02-15 10:26:40,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,408 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 387 transitions. [2023-02-15 10:26:40,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 10:26:40,411 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:40,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:40,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 10:26:40,411 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:40,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:40,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1390396642, now seen corresponding path program 1 times [2023-02-15 10:26:40,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:40,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210370689] [2023-02-15 10:26:40,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:40,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:40,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:40,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210370689] [2023-02-15 10:26:40,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210370689] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:40,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:40,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:40,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969490411] [2023-02-15 10:26:40,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:40,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:40,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:40,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:40,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,432 INFO L87 Difference]: Start difference. First operand 229 states and 387 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:40,440 INFO L93 Difference]: Finished difference Result 289 states and 493 transitions. [2023-02-15 10:26:40,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:40,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 10:26:40,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:40,441 INFO L225 Difference]: With dead ends: 289 [2023-02-15 10:26:40,441 INFO L226 Difference]: Without dead ends: 287 [2023-02-15 10:26:40,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,442 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 37 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:40,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 152 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:40,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-02-15 10:26:40,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 229. [2023-02-15 10:26:40,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 383 transitions. [2023-02-15 10:26:40,452 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 383 transitions. Word has length 18 [2023-02-15 10:26:40,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:40,452 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 383 transitions. [2023-02-15 10:26:40,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 383 transitions. [2023-02-15 10:26:40,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 10:26:40,453 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:40,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:40,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 10:26:40,454 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:40,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:40,454 INFO L85 PathProgramCache]: Analyzing trace with hash -739214602, now seen corresponding path program 1 times [2023-02-15 10:26:40,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:40,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433176212] [2023-02-15 10:26:40,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:40,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:40,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:40,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433176212] [2023-02-15 10:26:40,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433176212] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:40,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:40,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:40,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114215650] [2023-02-15 10:26:40,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:40,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:40,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:40,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:40,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,473 INFO L87 Difference]: Start difference. First operand 229 states and 383 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:40,498 INFO L93 Difference]: Finished difference Result 421 states and 713 transitions. [2023-02-15 10:26:40,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:40,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 10:26:40,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:40,499 INFO L225 Difference]: With dead ends: 421 [2023-02-15 10:26:40,499 INFO L226 Difference]: Without dead ends: 419 [2023-02-15 10:26:40,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,500 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 34 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:40,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 109 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:40,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-02-15 10:26:40,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 321. [2023-02-15 10:26:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 1.646875) internal successors, (527), 320 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 527 transitions. [2023-02-15 10:26:40,512 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 527 transitions. Word has length 19 [2023-02-15 10:26:40,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:40,512 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 527 transitions. [2023-02-15 10:26:40,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,512 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 527 transitions. [2023-02-15 10:26:40,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 10:26:40,521 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:40,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:40,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 10:26:40,522 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:40,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash -481049164, now seen corresponding path program 1 times [2023-02-15 10:26:40,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:40,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840895499] [2023-02-15 10:26:40,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:40,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:40,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:40,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:40,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840895499] [2023-02-15 10:26:40,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840895499] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:40,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:40,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:40,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224877009] [2023-02-15 10:26:40,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:40,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:40,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:40,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:40,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,592 INFO L87 Difference]: Start difference. First operand 321 states and 527 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:40,614 INFO L93 Difference]: Finished difference Result 757 states and 1249 transitions. [2023-02-15 10:26:40,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:40,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 10:26:40,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:40,616 INFO L225 Difference]: With dead ends: 757 [2023-02-15 10:26:40,616 INFO L226 Difference]: Without dead ends: 443 [2023-02-15 10:26:40,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,620 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 40 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:40,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 132 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:40,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-02-15 10:26:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2023-02-15 10:26:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.625) internal successors, (715), 440 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 715 transitions. [2023-02-15 10:26:40,638 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 715 transitions. Word has length 19 [2023-02-15 10:26:40,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:40,638 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 715 transitions. [2023-02-15 10:26:40,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,638 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 715 transitions. [2023-02-15 10:26:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 10:26:40,639 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:40,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:40,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 10:26:40,639 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:40,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:40,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1440601487, now seen corresponding path program 1 times [2023-02-15 10:26:40,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:40,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382645398] [2023-02-15 10:26:40,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:40,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:40,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:40,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:40,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382645398] [2023-02-15 10:26:40,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382645398] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:40,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:40,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:40,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703255574] [2023-02-15 10:26:40,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:40,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:40,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:40,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:40,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,656 INFO L87 Difference]: Start difference. First operand 441 states and 715 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:40,669 INFO L93 Difference]: Finished difference Result 669 states and 1081 transitions. [2023-02-15 10:26:40,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:40,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-15 10:26:40,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:40,670 INFO L225 Difference]: With dead ends: 669 [2023-02-15 10:26:40,671 INFO L226 Difference]: Without dead ends: 455 [2023-02-15 10:26:40,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,673 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 42 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:40,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 132 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:40,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2023-02-15 10:26:40,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 453. [2023-02-15 10:26:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.5995575221238938) internal successors, (723), 452 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 723 transitions. [2023-02-15 10:26:40,682 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 723 transitions. Word has length 20 [2023-02-15 10:26:40,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:40,682 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 723 transitions. [2023-02-15 10:26:40,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,682 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 723 transitions. [2023-02-15 10:26:40,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 10:26:40,683 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:40,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:40,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 10:26:40,683 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:40,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:40,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2027407501, now seen corresponding path program 1 times [2023-02-15 10:26:40,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:40,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775527588] [2023-02-15 10:26:40,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:40,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:40,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:40,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775527588] [2023-02-15 10:26:40,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775527588] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:40,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:40,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:40,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939264109] [2023-02-15 10:26:40,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:40,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:40,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:40,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:40,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,720 INFO L87 Difference]: Start difference. First operand 453 states and 723 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:40,732 INFO L93 Difference]: Finished difference Result 809 states and 1309 transitions. [2023-02-15 10:26:40,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:40,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-15 10:26:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:40,734 INFO L225 Difference]: With dead ends: 809 [2023-02-15 10:26:40,734 INFO L226 Difference]: Without dead ends: 807 [2023-02-15 10:26:40,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,735 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 31 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:40,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 107 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:40,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2023-02-15 10:26:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 645. [2023-02-15 10:26:40,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.5574534161490683) internal successors, (1003), 644 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1003 transitions. [2023-02-15 10:26:40,745 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1003 transitions. Word has length 20 [2023-02-15 10:26:40,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:40,745 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 1003 transitions. [2023-02-15 10:26:40,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,745 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1003 transitions. [2023-02-15 10:26:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 10:26:40,746 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:40,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:40,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 10:26:40,746 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:40,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:40,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1769242063, now seen corresponding path program 1 times [2023-02-15 10:26:40,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:40,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364550867] [2023-02-15 10:26:40,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:40,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:40,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:40,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364550867] [2023-02-15 10:26:40,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364550867] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:40,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:40,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:40,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875213770] [2023-02-15 10:26:40,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:40,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:40,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:40,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:40,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,779 INFO L87 Difference]: Start difference. First operand 645 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:40,798 INFO L93 Difference]: Finished difference Result 1497 states and 2333 transitions. [2023-02-15 10:26:40,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:40,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-15 10:26:40,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:40,801 INFO L225 Difference]: With dead ends: 1497 [2023-02-15 10:26:40,801 INFO L226 Difference]: Without dead ends: 871 [2023-02-15 10:26:40,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,802 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 39 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:40,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 133 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:40,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2023-02-15 10:26:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2023-02-15 10:26:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.5334101382488479) internal successors, (1331), 868 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1331 transitions. [2023-02-15 10:26:40,819 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1331 transitions. Word has length 20 [2023-02-15 10:26:40,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:40,819 INFO L495 AbstractCegarLoop]: Abstraction has 869 states and 1331 transitions. [2023-02-15 10:26:40,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,819 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1331 transitions. [2023-02-15 10:26:40,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 10:26:40,822 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:40,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:40,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 10:26:40,822 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:40,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:40,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1575091945, now seen corresponding path program 1 times [2023-02-15 10:26:40,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:40,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768195645] [2023-02-15 10:26:40,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:40,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:40,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:40,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768195645] [2023-02-15 10:26:40,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768195645] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:40,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:40,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:40,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058793956] [2023-02-15 10:26:40,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:40,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:40,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:40,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:40,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,848 INFO L87 Difference]: Start difference. First operand 869 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:40,861 INFO L93 Difference]: Finished difference Result 1305 states and 1989 transitions. [2023-02-15 10:26:40,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:40,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 10:26:40,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:40,864 INFO L225 Difference]: With dead ends: 1305 [2023-02-15 10:26:40,864 INFO L226 Difference]: Without dead ends: 887 [2023-02-15 10:26:40,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,865 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:40,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:40,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2023-02-15 10:26:40,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2023-02-15 10:26:40,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1331 transitions. [2023-02-15 10:26:40,879 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1331 transitions. Word has length 21 [2023-02-15 10:26:40,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:40,880 INFO L495 AbstractCegarLoop]: Abstraction has 885 states and 1331 transitions. [2023-02-15 10:26:40,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,880 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1331 transitions. [2023-02-15 10:26:40,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 10:26:40,880 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:40,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:40,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 10:26:40,881 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:40,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:40,881 INFO L85 PathProgramCache]: Analyzing trace with hash 988285931, now seen corresponding path program 1 times [2023-02-15 10:26:40,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:40,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115382272] [2023-02-15 10:26:40,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:40,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:40,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:40,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:40,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115382272] [2023-02-15 10:26:40,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115382272] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:40,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:40,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:40,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810150816] [2023-02-15 10:26:40,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:40,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:40,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:40,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:40,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,895 INFO L87 Difference]: Start difference. First operand 885 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:40,912 INFO L93 Difference]: Finished difference Result 1545 states and 2357 transitions. [2023-02-15 10:26:40,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:40,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 10:26:40,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:40,916 INFO L225 Difference]: With dead ends: 1545 [2023-02-15 10:26:40,916 INFO L226 Difference]: Without dead ends: 1543 [2023-02-15 10:26:40,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,917 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:40,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 105 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:40,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2023-02-15 10:26:40,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1285. [2023-02-15 10:26:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1875 transitions. [2023-02-15 10:26:40,936 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1875 transitions. Word has length 21 [2023-02-15 10:26:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:40,937 INFO L495 AbstractCegarLoop]: Abstraction has 1285 states and 1875 transitions. [2023-02-15 10:26:40,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1875 transitions. [2023-02-15 10:26:40,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 10:26:40,938 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:40,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:40,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 10:26:40,938 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:40,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:40,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1246451369, now seen corresponding path program 1 times [2023-02-15 10:26:40,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:40,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769084948] [2023-02-15 10:26:40,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:40,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:40,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:40,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769084948] [2023-02-15 10:26:40,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769084948] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:40,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:40,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:40,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225692979] [2023-02-15 10:26:40,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:40,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:40,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:40,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:40,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:40,952 INFO L87 Difference]: Start difference. First operand 1285 states and 1875 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:40,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:40,989 INFO L93 Difference]: Finished difference Result 2953 states and 4309 transitions. [2023-02-15 10:26:40,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:40,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 10:26:40,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:40,995 INFO L225 Difference]: With dead ends: 2953 [2023-02-15 10:26:40,995 INFO L226 Difference]: Without dead ends: 1703 [2023-02-15 10:26:40,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 [2023-02-15 10:26:40,997 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:40,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:40,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2023-02-15 10:26:41,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1701. [2023-02-15 10:26:41,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2435 transitions. [2023-02-15 10:26:41,037 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2435 transitions. Word has length 21 [2023-02-15 10:26:41,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:41,038 INFO L495 AbstractCegarLoop]: Abstraction has 1701 states and 2435 transitions. [2023-02-15 10:26:41,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2435 transitions. [2023-02-15 10:26:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 10:26:41,040 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:41,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:41,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 10:26:41,040 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:41,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:41,040 INFO L85 PathProgramCache]: Analyzing trace with hash 572308166, now seen corresponding path program 1 times [2023-02-15 10:26:41,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:41,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449115906] [2023-02-15 10:26:41,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:41,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:41,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:41,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449115906] [2023-02-15 10:26:41,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449115906] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:41,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:41,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:41,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700541035] [2023-02-15 10:26:41,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:41,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:41,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:41,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:41,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:41,061 INFO L87 Difference]: Start difference. First operand 1701 states and 2435 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:41,101 INFO L93 Difference]: Finished difference Result 2553 states and 3637 transitions. [2023-02-15 10:26:41,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:41,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 10:26:41,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:41,106 INFO L225 Difference]: With dead ends: 2553 [2023-02-15 10:26:41,106 INFO L226 Difference]: Without dead ends: 1735 [2023-02-15 10:26:41,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:41,107 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:41,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:41,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2023-02-15 10:26:41,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1733. [2023-02-15 10:26:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2435 transitions. [2023-02-15 10:26:41,141 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2435 transitions. Word has length 22 [2023-02-15 10:26:41,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:41,141 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2435 transitions. [2023-02-15 10:26:41,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2435 transitions. [2023-02-15 10:26:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 10:26:41,143 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:41,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:41,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 10:26:41,143 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:41,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:41,143 INFO L85 PathProgramCache]: Analyzing trace with hash -14497848, now seen corresponding path program 1 times [2023-02-15 10:26:41,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:41,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230297287] [2023-02-15 10:26:41,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:41,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:41,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:41,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230297287] [2023-02-15 10:26:41,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230297287] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:41,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:41,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:41,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636832772] [2023-02-15 10:26:41,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:41,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:41,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:41,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:41,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:41,160 INFO L87 Difference]: Start difference. First operand 1733 states and 2435 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:41,192 INFO L93 Difference]: Finished difference Result 2953 states and 4197 transitions. [2023-02-15 10:26:41,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:41,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 10:26:41,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:41,199 INFO L225 Difference]: With dead ends: 2953 [2023-02-15 10:26:41,199 INFO L226 Difference]: Without dead ends: 2951 [2023-02-15 10:26:41,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 [2023-02-15 10:26:41,202 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 25 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:41,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 103 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:41,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2023-02-15 10:26:41,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2565. [2023-02-15 10:26:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3491 transitions. [2023-02-15 10:26:41,249 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3491 transitions. Word has length 22 [2023-02-15 10:26:41,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:41,249 INFO L495 AbstractCegarLoop]: Abstraction has 2565 states and 3491 transitions. [2023-02-15 10:26:41,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3491 transitions. [2023-02-15 10:26:41,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 10:26:41,252 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:41,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:41,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 10:26:41,252 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:41,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:41,252 INFO L85 PathProgramCache]: Analyzing trace with hash 243667590, now seen corresponding path program 1 times [2023-02-15 10:26:41,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:41,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352401508] [2023-02-15 10:26:41,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:41,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:41,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:41,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352401508] [2023-02-15 10:26:41,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352401508] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:41,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:41,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:41,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605809884] [2023-02-15 10:26:41,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:41,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:41,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:41,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:41,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:41,271 INFO L87 Difference]: Start difference. First operand 2565 states and 3491 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:41,328 INFO L93 Difference]: Finished difference Result 5833 states and 7909 transitions. [2023-02-15 10:26:41,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:41,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 10:26:41,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:41,335 INFO L225 Difference]: With dead ends: 5833 [2023-02-15 10:26:41,335 INFO L226 Difference]: Without dead ends: 3335 [2023-02-15 10:26:41,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:41,338 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:41,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2023-02-15 10:26:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3333. [2023-02-15 10:26:41,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4419 transitions. [2023-02-15 10:26:41,401 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4419 transitions. Word has length 22 [2023-02-15 10:26:41,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:41,402 INFO L495 AbstractCegarLoop]: Abstraction has 3333 states and 4419 transitions. [2023-02-15 10:26:41,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4419 transitions. [2023-02-15 10:26:41,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 10:26:41,405 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:41,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:41,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 10:26:41,405 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:41,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:41,405 INFO L85 PathProgramCache]: Analyzing trace with hash -449217570, now seen corresponding path program 1 times [2023-02-15 10:26:41,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:41,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624147290] [2023-02-15 10:26:41,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:41,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:41,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:41,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:41,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624147290] [2023-02-15 10:26:41,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624147290] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:41,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:41,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:41,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084303293] [2023-02-15 10:26:41,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:41,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:41,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:41,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:41,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:41,427 INFO L87 Difference]: Start difference. First operand 3333 states and 4419 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:41,465 INFO L93 Difference]: Finished difference Result 5001 states and 6597 transitions. [2023-02-15 10:26:41,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:41,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-15 10:26:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:41,473 INFO L225 Difference]: With dead ends: 5001 [2023-02-15 10:26:41,473 INFO L226 Difference]: Without dead ends: 3399 [2023-02-15 10:26:41,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:41,475 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 39 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:41,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 120 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:41,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2023-02-15 10:26:41,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3397. [2023-02-15 10:26:41,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4419 transitions. [2023-02-15 10:26:41,563 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4419 transitions. Word has length 23 [2023-02-15 10:26:41,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:41,563 INFO L495 AbstractCegarLoop]: Abstraction has 3397 states and 4419 transitions. [2023-02-15 10:26:41,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4419 transitions. [2023-02-15 10:26:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 10:26:41,565 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:41,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:41,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-15 10:26:41,566 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:41,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:41,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1036023584, now seen corresponding path program 1 times [2023-02-15 10:26:41,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:41,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701685091] [2023-02-15 10:26:41,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:41,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:41,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:41,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701685091] [2023-02-15 10:26:41,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701685091] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:41,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:41,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:41,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034349049] [2023-02-15 10:26:41,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:41,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:41,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:41,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:41,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:41,585 INFO L87 Difference]: Start difference. First operand 3397 states and 4419 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:41,641 INFO L93 Difference]: Finished difference Result 5641 states and 7365 transitions. [2023-02-15 10:26:41,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:41,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-15 10:26:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:41,667 INFO L225 Difference]: With dead ends: 5641 [2023-02-15 10:26:41,667 INFO L226 Difference]: Without dead ends: 5639 [2023-02-15 10:26:41,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:41,670 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:41,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 101 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:41,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2023-02-15 10:26:41,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5125. [2023-02-15 10:26:41,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 6467 transitions. [2023-02-15 10:26:41,757 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 6467 transitions. Word has length 23 [2023-02-15 10:26:41,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:41,758 INFO L495 AbstractCegarLoop]: Abstraction has 5125 states and 6467 transitions. [2023-02-15 10:26:41,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 6467 transitions. [2023-02-15 10:26:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 10:26:41,762 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:41,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:41,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 10:26:41,763 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:41,763 INFO L85 PathProgramCache]: Analyzing trace with hash -777858146, now seen corresponding path program 1 times [2023-02-15 10:26:41,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:41,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50512847] [2023-02-15 10:26:41,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:41,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:41,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:41,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50512847] [2023-02-15 10:26:41,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50512847] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:41,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:41,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:41,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738809751] [2023-02-15 10:26:41,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:41,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:41,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:41,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:41,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:41,779 INFO L87 Difference]: Start difference. First operand 5125 states and 6467 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:41,865 INFO L93 Difference]: Finished difference Result 11529 states and 14405 transitions. [2023-02-15 10:26:41,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:41,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-15 10:26:41,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:41,873 INFO L225 Difference]: With dead ends: 11529 [2023-02-15 10:26:41,873 INFO L226 Difference]: Without dead ends: 6535 [2023-02-15 10:26:41,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:41,878 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 36 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:41,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:41,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2023-02-15 10:26:41,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 6533. [2023-02-15 10:26:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 7939 transitions. [2023-02-15 10:26:41,994 INFO L78 Accepts]: Start accepts. Automaton has 6533 states and 7939 transitions. Word has length 23 [2023-02-15 10:26:41,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:41,994 INFO L495 AbstractCegarLoop]: Abstraction has 6533 states and 7939 transitions. [2023-02-15 10:26:41,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 6533 states and 7939 transitions. [2023-02-15 10:26:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 10:26:42,000 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:42,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:42,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-15 10:26:42,000 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:42,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:42,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2051743973, now seen corresponding path program 1 times [2023-02-15 10:26:42,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:42,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391412741] [2023-02-15 10:26:42,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:42,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:42,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:42,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391412741] [2023-02-15 10:26:42,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391412741] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:42,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:42,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:42,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657755742] [2023-02-15 10:26:42,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:42,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:42,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:42,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:42,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:42,019 INFO L87 Difference]: Start difference. First operand 6533 states and 7939 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:42,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:42,108 INFO L93 Difference]: Finished difference Result 9801 states and 11845 transitions. [2023-02-15 10:26:42,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:42,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-15 10:26:42,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:42,116 INFO L225 Difference]: With dead ends: 9801 [2023-02-15 10:26:42,116 INFO L226 Difference]: Without dead ends: 6663 [2023-02-15 10:26:42,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:42,120 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 38 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:42,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:42,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6663 states. [2023-02-15 10:26:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6663 to 6661. [2023-02-15 10:26:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 7939 transitions. [2023-02-15 10:26:42,228 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 7939 transitions. Word has length 24 [2023-02-15 10:26:42,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:42,228 INFO L495 AbstractCegarLoop]: Abstraction has 6661 states and 7939 transitions. [2023-02-15 10:26:42,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:42,228 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 7939 transitions. [2023-02-15 10:26:42,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 10:26:42,233 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:42,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:42,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 10:26:42,233 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:42,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:42,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1656417309, now seen corresponding path program 1 times [2023-02-15 10:26:42,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:42,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767142689] [2023-02-15 10:26:42,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:42,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:42,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:42,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767142689] [2023-02-15 10:26:42,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767142689] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:42,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:42,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:42,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983193463] [2023-02-15 10:26:42,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:42,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:42,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:42,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:42,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:42,250 INFO L87 Difference]: Start difference. First operand 6661 states and 7939 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:42,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:42,398 INFO L93 Difference]: Finished difference Result 10759 states and 12676 transitions. [2023-02-15 10:26:42,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:42,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-15 10:26:42,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:42,409 INFO L225 Difference]: With dead ends: 10759 [2023-02-15 10:26:42,409 INFO L226 Difference]: Without dead ends: 10757 [2023-02-15 10:26:42,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:42,411 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:42,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 98 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:42,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10757 states. [2023-02-15 10:26:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10757 to 10245. [2023-02-15 10:26:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:42,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 11907 transitions. [2023-02-15 10:26:42,586 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 11907 transitions. Word has length 24 [2023-02-15 10:26:42,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:42,586 INFO L495 AbstractCegarLoop]: Abstraction has 10245 states and 11907 transitions. [2023-02-15 10:26:42,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 11907 transitions. [2023-02-15 10:26:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 10:26:42,595 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:26:42,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:42,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-15 10:26:42,596 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:26:42,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:26:42,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1914582747, now seen corresponding path program 1 times [2023-02-15 10:26:42,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:26:42,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722694729] [2023-02-15 10:26:42,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:26:42,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:26:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:26:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:26:42,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:26:42,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722694729] [2023-02-15 10:26:42,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722694729] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:26:42,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:26:42,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:26:42,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785266193] [2023-02-15 10:26:42,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:26:42,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:26:42,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:26:42,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:26:42,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:42,607 INFO L87 Difference]: Start difference. First operand 10245 states and 11907 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:42,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:26:42,710 INFO L93 Difference]: Finished difference Result 22789 states and 25987 transitions. [2023-02-15 10:26:42,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:26:42,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-15 10:26:42,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:26:42,711 INFO L225 Difference]: With dead ends: 22789 [2023-02-15 10:26:42,711 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 10:26:42,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:26:42,724 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 34 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:26:42,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:26:42,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 10:26:42,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 10:26:42,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 10:26:42,724 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2023-02-15 10:26:42,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:26:42,724 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 10:26:42,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:26:42,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 10:26:42,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 10:26:42,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 10:26:42,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-15 10:26:42,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 10:26:42,736 INFO L899 garLoopResultBuilder]: For program point L126-1(lines 38 146) no Hoare annotation was computed. [2023-02-15 10:26:42,736 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 6 151) the Hoare annotation is: true [2023-02-15 10:26:42,736 INFO L899 garLoopResultBuilder]: For program point L102(line 102) no Hoare annotation was computed. [2023-02-15 10:26:42,736 INFO L899 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2023-02-15 10:26:42,736 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 10:26:42,736 INFO L899 garLoopResultBuilder]: For program point L111-1(lines 38 146) no Hoare annotation was computed. [2023-02-15 10:26:42,736 INFO L899 garLoopResultBuilder]: For program point L136-1(lines 38 146) no Hoare annotation was computed. [2023-02-15 10:26:42,736 INFO L899 garLoopResultBuilder]: For program point L95-1(lines 38 146) no Hoare annotation was computed. [2023-02-15 10:26:42,736 INFO L899 garLoopResultBuilder]: For program point L87-1(lines 38 146) no Hoare annotation was computed. [2023-02-15 10:26:42,736 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2023-02-15 10:26:42,736 INFO L899 garLoopResultBuilder]: For program point L79-1(lines 38 146) no Hoare annotation was computed. [2023-02-15 10:26:42,737 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 10:26:42,737 INFO L899 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2023-02-15 10:26:42,737 INFO L899 garLoopResultBuilder]: For program point L71-1(lines 38 146) no Hoare annotation was computed. [2023-02-15 10:26:42,737 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 65) no Hoare annotation was computed. [2023-02-15 10:26:42,737 INFO L899 garLoopResultBuilder]: For program point L63-2(lines 38 146) no Hoare annotation was computed. [2023-02-15 10:26:42,737 INFO L899 garLoopResultBuilder]: For program point L121-1(lines 38 146) no Hoare annotation was computed. [2023-02-15 10:26:42,737 INFO L899 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2023-02-15 10:26:42,737 INFO L902 garLoopResultBuilder]: At program point L147(lines 7 151) the Hoare annotation is: true [2023-02-15 10:26:42,737 INFO L899 garLoopResultBuilder]: For program point L106-1(lines 38 146) no Hoare annotation was computed. [2023-02-15 10:26:42,737 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-02-15 10:26:42,737 INFO L899 garLoopResultBuilder]: For program point L131-1(lines 38 146) no Hoare annotation was computed. [2023-02-15 10:26:42,737 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 10:26:42,737 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2023-02-15 10:26:42,737 INFO L899 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2023-02-15 10:26:42,737 INFO L899 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2023-02-15 10:26:42,737 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 10:26:42,737 INFO L899 garLoopResultBuilder]: For program point L91-1(lines 38 146) no Hoare annotation was computed. [2023-02-15 10:26:42,738 INFO L899 garLoopResultBuilder]: For program point L116-1(lines 38 146) no Hoare annotation was computed. [2023-02-15 10:26:42,738 INFO L899 garLoopResultBuilder]: For program point L83-1(lines 38 146) no Hoare annotation was computed. [2023-02-15 10:26:42,738 INFO L902 garLoopResultBuilder]: At program point L141-1(lines 38 146) the Hoare annotation is: true [2023-02-15 10:26:42,738 INFO L899 garLoopResultBuilder]: For program point L75-1(lines 38 146) no Hoare annotation was computed. [2023-02-15 10:26:42,738 INFO L899 garLoopResultBuilder]: For program point L67-1(lines 38 146) no Hoare annotation was computed. [2023-02-15 10:26:42,738 INFO L895 garLoopResultBuilder]: At program point main_ERROR#1(lines 7 151) the Hoare annotation is: false [2023-02-15 10:26:42,738 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2023-02-15 10:26:42,738 INFO L899 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2023-02-15 10:26:42,738 INFO L899 garLoopResultBuilder]: For program point L101-1(lines 38 146) no Hoare annotation was computed. [2023-02-15 10:26:42,740 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:26:42,741 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 10:26:42,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:26:42 BoogieIcfgContainer [2023-02-15 10:26:42,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 10:26:42,746 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 10:26:42,746 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 10:26:42,746 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 10:26:42,747 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:26:39" (3/4) ... [2023-02-15 10:26:42,748 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 10:26:42,754 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-02-15 10:26:42,755 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-15 10:26:42,755 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 10:26:42,755 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 10:26:42,777 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 10:26:42,777 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 10:26:42,778 INFO L158 Benchmark]: Toolchain (without parser) took 3739.33ms. Allocated memory was 138.4MB in the beginning and 314.6MB in the end (delta: 176.2MB). Free memory was 71.3MB in the beginning and 106.1MB in the end (delta: -34.9MB). Peak memory consumption was 142.4MB. Max. memory is 16.1GB. [2023-02-15 10:26:42,778 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory was 113.6MB in the beginning and 113.4MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:26:42,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.79ms. Allocated memory was 138.4MB in the beginning and 211.8MB in the end (delta: 73.4MB). Free memory was 71.0MB in the beginning and 180.1MB in the end (delta: -109.2MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2023-02-15 10:26:42,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.08ms. Allocated memory is still 211.8MB. Free memory was 180.1MB in the beginning and 178.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 10:26:42,778 INFO L158 Benchmark]: Boogie Preprocessor took 15.26ms. Allocated memory is still 211.8MB. Free memory was 178.0MB in the beginning and 177.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 10:26:42,778 INFO L158 Benchmark]: RCFGBuilder took 244.55ms. Allocated memory is still 211.8MB. Free memory was 177.0MB in the beginning and 162.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 10:26:42,778 INFO L158 Benchmark]: TraceAbstraction took 3161.41ms. Allocated memory was 211.8MB in the beginning and 314.6MB in the end (delta: 102.8MB). Free memory was 162.3MB in the beginning and 110.3MB in the end (delta: 52.0MB). Peak memory consumption was 153.7MB. Max. memory is 16.1GB. [2023-02-15 10:26:42,778 INFO L158 Benchmark]: Witness Printer took 31.07ms. Allocated memory is still 314.6MB. Free memory was 110.3MB in the beginning and 106.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 10:26:42,779 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.14ms. Allocated memory is still 138.4MB. Free memory was 113.6MB in the beginning and 113.4MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.79ms. Allocated memory was 138.4MB in the beginning and 211.8MB in the end (delta: 73.4MB). Free memory was 71.0MB in the beginning and 180.1MB in the end (delta: -109.2MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.08ms. Allocated memory is still 211.8MB. Free memory was 180.1MB in the beginning and 178.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.26ms. Allocated memory is still 211.8MB. Free memory was 178.0MB in the beginning and 177.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 244.55ms. Allocated memory is still 211.8MB. Free memory was 177.0MB in the beginning and 162.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3161.41ms. Allocated memory was 211.8MB in the beginning and 314.6MB in the end (delta: 102.8MB). Free memory was 162.3MB in the beginning and 110.3MB in the end (delta: 52.0MB). Peak memory consumption was 153.7MB. Max. memory is 16.1GB. * Witness Printer took 31.07ms. Allocated memory is still 314.6MB. Free memory was 110.3MB in the beginning and 106.1MB 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: 149]: 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 922 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 922 mSDsluCounter, 3098 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1232 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 133 IncrementalHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1866 mSDtfsCounter, 133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10245occurred in iteration=24, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 521 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 480 ConstructedInterpolants, 0 QuantifiedInterpolants, 1011 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-15 10:26:42,791 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