./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_10.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 c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:57:06,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:57:06,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:57:06,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:57:06,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:57:06,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:57:06,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:57:06,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:57:06,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:57:06,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:57:06,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:57:06,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:57:06,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:57:06,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:57:06,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:57:06,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:57:06,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:57:06,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:57:06,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:57:06,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:57:06,396 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:57:06,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:57:06,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:57:06,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:57:06,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:57:06,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:57:06,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:57:06,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:57:06,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:57:06,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:57:06,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:57:06,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:57:06,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:57:06,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:57:06,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:57:06,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:57:06,412 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:57:06,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:57:06,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:57:06,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:57:06,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:57:06,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:57:06,417 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:57:06,456 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:57:06,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:57:06,457 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:57:06,457 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:57:06,458 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:57:06,458 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:57:06,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:57:06,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:57:06,459 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:57:06,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:57:06,460 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:57:06,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:57:06,460 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:57:06,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:57:06,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:57:06,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:57:06,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:57:06,461 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:57:06,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:57:06,461 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:57:06,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:57:06,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:57:06,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:57:06,462 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:57:06,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:57:06,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:57:06,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:57:06,463 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:57:06,463 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:57:06,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:57:06,463 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:57:06,463 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:57:06,463 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:57:06,464 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b [2022-07-19 10:57:06,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:57:06,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:57:06,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:57:06,735 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:57:06,736 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:57:06,737 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_10.c [2022-07-19 10:57:06,790 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/725e5a811/23cfdfc1560f434fb21f16c5deeae46a/FLAG46d4a012c [2022-07-19 10:57:07,241 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:57:07,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2022-07-19 10:57:07,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/725e5a811/23cfdfc1560f434fb21f16c5deeae46a/FLAG46d4a012c [2022-07-19 10:57:07,640 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/725e5a811/23cfdfc1560f434fb21f16c5deeae46a [2022-07-19 10:57:07,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:57:07,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:57:07,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:57:07,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:57:07,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:57:07,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:57:07" (1/1) ... [2022-07-19 10:57:07,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c6d72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:07, skipping insertion in model container [2022-07-19 10:57:07,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:57:07" (1/1) ... [2022-07-19 10:57:07,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:57:07,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:57:07,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c[3901,3914] [2022-07-19 10:57:07,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:57:07,904 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:57:07,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c[3901,3914] [2022-07-19 10:57:07,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:57:07,961 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:57:07,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:07 WrapperNode [2022-07-19 10:57:07,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:57:07,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:57:07,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:57:07,963 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:57:07,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:07" (1/1) ... [2022-07-19 10:57:07,982 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:07" (1/1) ... [2022-07-19 10:57:08,008 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 138 [2022-07-19 10:57:08,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:57:08,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:57:08,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:57:08,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:57:08,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:07" (1/1) ... [2022-07-19 10:57:08,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:07" (1/1) ... [2022-07-19 10:57:08,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:07" (1/1) ... [2022-07-19 10:57:08,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:07" (1/1) ... [2022-07-19 10:57:08,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:07" (1/1) ... [2022-07-19 10:57:08,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:07" (1/1) ... [2022-07-19 10:57:08,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:07" (1/1) ... [2022-07-19 10:57:08,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:57:08,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:57:08,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:57:08,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:57:08,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:07" (1/1) ... [2022-07-19 10:57:08,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:57:08,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:57:08,089 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 10:57:08,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 10:57:08,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:57:08,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:57:08,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:57:08,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:57:08,194 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:57:08,195 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:57:08,460 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:57:08,465 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:57:08,465 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 10:57:08,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:57:08 BoogieIcfgContainer [2022-07-19 10:57:08,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:57:08,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:57:08,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:57:08,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:57:08,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:57:07" (1/3) ... [2022-07-19 10:57:08,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf0457b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:57:08, skipping insertion in model container [2022-07-19 10:57:08,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:07" (2/3) ... [2022-07-19 10:57:08,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf0457b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:57:08, skipping insertion in model container [2022-07-19 10:57:08,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:57:08" (3/3) ... [2022-07-19 10:57:08,477 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2022-07-19 10:57:08,490 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:57:08,491 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:57:08,550 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:57:08,559 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3d32e577, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6ce95a15 [2022-07-19 10:57:08,560 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:57:08,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 38 states have (on average 1.894736842105263) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 10:57:08,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:08,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:08,581 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:08,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:08,589 INFO L85 PathProgramCache]: Analyzing trace with hash 153349273, now seen corresponding path program 1 times [2022-07-19 10:57:08,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:08,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041075708] [2022-07-19 10:57:08,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:08,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:08,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:08,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041075708] [2022-07-19 10:57:08,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041075708] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:08,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:08,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:08,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158297413] [2022-07-19 10:57:08,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:08,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:08,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:08,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:08,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:08,859 INFO L87 Difference]: Start difference. First operand has 40 states, 38 states have (on average 1.894736842105263) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 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.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) [2022-07-19 10:57:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:08,914 INFO L93 Difference]: Finished difference Result 83 states and 145 transitions. [2022-07-19 10:57:08,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:08,916 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 [2022-07-19 10:57:08,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:08,927 INFO L225 Difference]: With dead ends: 83 [2022-07-19 10:57:08,927 INFO L226 Difference]: Without dead ends: 69 [2022-07-19 10:57:08,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:08,938 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:08,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-19 10:57:08,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2022-07-19 10:57:08,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 46 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 86 transitions. [2022-07-19 10:57:08,979 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 86 transitions. Word has length 17 [2022-07-19 10:57:08,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:08,980 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 86 transitions. [2022-07-19 10:57:08,981 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) [2022-07-19 10:57:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2022-07-19 10:57:08,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 10:57:08,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:08,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:08,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:57:08,983 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:08,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:08,984 INFO L85 PathProgramCache]: Analyzing trace with hash -433456741, now seen corresponding path program 1 times [2022-07-19 10:57:08,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:08,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718737343] [2022-07-19 10:57:08,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:08,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:09,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:09,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718737343] [2022-07-19 10:57:09,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718737343] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:09,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:09,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:09,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126546486] [2022-07-19 10:57:09,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:09,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:09,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:09,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:09,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,060 INFO L87 Difference]: Start difference. First operand 47 states and 86 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) [2022-07-19 10:57:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:09,100 INFO L93 Difference]: Finished difference Result 114 states and 209 transitions. [2022-07-19 10:57:09,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:09,101 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 [2022-07-19 10:57:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:09,103 INFO L225 Difference]: With dead ends: 114 [2022-07-19 10:57:09,104 INFO L226 Difference]: Without dead ends: 69 [2022-07-19 10:57:09,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,107 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:09,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 143 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:09,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-19 10:57:09,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-07-19 10:57:09,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 122 transitions. [2022-07-19 10:57:09,123 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 122 transitions. Word has length 17 [2022-07-19 10:57:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:09,125 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 122 transitions. [2022-07-19 10:57:09,125 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) [2022-07-19 10:57:09,125 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2022-07-19 10:57:09,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 10:57:09,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:09,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:09,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:57:09,129 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:09,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:09,131 INFO L85 PathProgramCache]: Analyzing trace with hash 459073515, now seen corresponding path program 1 times [2022-07-19 10:57:09,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:09,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179202699] [2022-07-19 10:57:09,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:09,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:09,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:09,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179202699] [2022-07-19 10:57:09,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179202699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:09,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:09,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:09,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107480431] [2022-07-19 10:57:09,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:09,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:09,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:09,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:09,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,189 INFO L87 Difference]: Start difference. First operand 67 states and 122 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) [2022-07-19 10:57:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:09,213 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2022-07-19 10:57:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:09,214 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 [2022-07-19 10:57:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:09,216 INFO L225 Difference]: With dead ends: 105 [2022-07-19 10:57:09,217 INFO L226 Difference]: Without dead ends: 72 [2022-07-19 10:57:09,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,222 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 50 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:09,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:09,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-19 10:57:09,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-07-19 10:57:09,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 69 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 124 transitions. [2022-07-19 10:57:09,240 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 124 transitions. Word has length 18 [2022-07-19 10:57:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:09,241 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 124 transitions. [2022-07-19 10:57:09,241 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) [2022-07-19 10:57:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 124 transitions. [2022-07-19 10:57:09,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 10:57:09,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:09,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:09,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 10:57:09,243 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:09,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:09,251 INFO L85 PathProgramCache]: Analyzing trace with hash -552043735, now seen corresponding path program 1 times [2022-07-19 10:57:09,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:09,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036868213] [2022-07-19 10:57:09,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:09,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:09,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:09,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036868213] [2022-07-19 10:57:09,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036868213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:09,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:09,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:09,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000381864] [2022-07-19 10:57:09,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:09,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:09,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:09,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:09,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,292 INFO L87 Difference]: Start difference. First operand 70 states and 124 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) [2022-07-19 10:57:09,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:09,311 INFO L93 Difference]: Finished difference Result 133 states and 237 transitions. [2022-07-19 10:57:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:09,312 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 [2022-07-19 10:57:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:09,313 INFO L225 Difference]: With dead ends: 133 [2022-07-19 10:57:09,314 INFO L226 Difference]: Without dead ends: 131 [2022-07-19 10:57:09,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,321 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 45 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:09,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 125 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:09,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-19 10:57:09,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 93. [2022-07-19 10:57:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.7934782608695652) internal successors, (165), 92 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 165 transitions. [2022-07-19 10:57:09,329 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 165 transitions. Word has length 18 [2022-07-19 10:57:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:09,330 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 165 transitions. [2022-07-19 10:57:09,330 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) [2022-07-19 10:57:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 165 transitions. [2022-07-19 10:57:09,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 10:57:09,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:09,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:09,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 10:57:09,336 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:09,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:09,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1138849749, now seen corresponding path program 1 times [2022-07-19 10:57:09,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:09,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868566170] [2022-07-19 10:57:09,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:09,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:09,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:09,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868566170] [2022-07-19 10:57:09,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868566170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:09,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:09,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:09,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336670400] [2022-07-19 10:57:09,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:09,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:09,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:09,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:09,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,422 INFO L87 Difference]: Start difference. First operand 93 states and 165 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) [2022-07-19 10:57:09,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:09,455 INFO L93 Difference]: Finished difference Result 221 states and 395 transitions. [2022-07-19 10:57:09,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:09,455 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 [2022-07-19 10:57:09,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:09,456 INFO L225 Difference]: With dead ends: 221 [2022-07-19 10:57:09,456 INFO L226 Difference]: Without dead ends: 133 [2022-07-19 10:57:09,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,464 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:09,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 144 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:09,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-19 10:57:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-07-19 10:57:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.7769230769230768) internal successors, (231), 130 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 231 transitions. [2022-07-19 10:57:09,479 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 231 transitions. Word has length 18 [2022-07-19 10:57:09,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:09,480 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 231 transitions. [2022-07-19 10:57:09,480 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) [2022-07-19 10:57:09,480 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 231 transitions. [2022-07-19 10:57:09,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 10:57:09,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:09,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:09,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 10:57:09,481 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:09,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:09,482 INFO L85 PathProgramCache]: Analyzing trace with hash 66727088, now seen corresponding path program 1 times [2022-07-19 10:57:09,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:09,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272427021] [2022-07-19 10:57:09,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:09,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:09,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:09,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272427021] [2022-07-19 10:57:09,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272427021] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:09,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:09,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:09,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725496061] [2022-07-19 10:57:09,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:09,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:09,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:09,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:09,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,535 INFO L87 Difference]: Start difference. First operand 131 states and 231 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) [2022-07-19 10:57:09,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:09,547 INFO L93 Difference]: Finished difference Result 198 states and 346 transitions. [2022-07-19 10:57:09,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:09,548 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 [2022-07-19 10:57:09,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:09,549 INFO L225 Difference]: With dead ends: 198 [2022-07-19 10:57:09,549 INFO L226 Difference]: Without dead ends: 135 [2022-07-19 10:57:09,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,552 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 49 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:09,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:09,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-19 10:57:09,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-07-19 10:57:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.75) internal successors, (231), 132 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 231 transitions. [2022-07-19 10:57:09,565 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 231 transitions. Word has length 19 [2022-07-19 10:57:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:09,565 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 231 transitions. [2022-07-19 10:57:09,565 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) [2022-07-19 10:57:09,565 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 231 transitions. [2022-07-19 10:57:09,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 10:57:09,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:09,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] [2022-07-19 10:57:09,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 10:57:09,567 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:09,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:09,567 INFO L85 PathProgramCache]: Analyzing trace with hash -944390162, now seen corresponding path program 1 times [2022-07-19 10:57:09,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:09,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941670356] [2022-07-19 10:57:09,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:09,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:09,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:09,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:09,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941670356] [2022-07-19 10:57:09,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941670356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:09,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:09,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:09,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186236648] [2022-07-19 10:57:09,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:09,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:09,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:09,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:09,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,604 INFO L87 Difference]: Start difference. First operand 133 states and 231 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) [2022-07-19 10:57:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:09,616 INFO L93 Difference]: Finished difference Result 381 states and 665 transitions. [2022-07-19 10:57:09,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:09,617 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 [2022-07-19 10:57:09,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:09,618 INFO L225 Difference]: With dead ends: 381 [2022-07-19 10:57:09,618 INFO L226 Difference]: Without dead ends: 255 [2022-07-19 10:57:09,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,619 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:09,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 127 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:09,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-07-19 10:57:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2022-07-19 10:57:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.7261904761904763) internal successors, (435), 252 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 435 transitions. [2022-07-19 10:57:09,627 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 435 transitions. Word has length 19 [2022-07-19 10:57:09,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:09,628 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 435 transitions. [2022-07-19 10:57:09,628 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) [2022-07-19 10:57:09,628 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 435 transitions. [2022-07-19 10:57:09,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 10:57:09,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:09,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:09,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 10:57:09,629 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:09,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:09,630 INFO L85 PathProgramCache]: Analyzing trace with hash -357584148, now seen corresponding path program 1 times [2022-07-19 10:57:09,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:09,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569519209] [2022-07-19 10:57:09,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:09,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:09,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:09,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569519209] [2022-07-19 10:57:09,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569519209] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:09,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:09,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:09,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833020901] [2022-07-19 10:57:09,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:09,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:09,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:09,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:09,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,665 INFO L87 Difference]: Start difference. First operand 253 states and 435 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) [2022-07-19 10:57:09,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:09,675 INFO L93 Difference]: Finished difference Result 321 states and 557 transitions. [2022-07-19 10:57:09,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:09,676 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 [2022-07-19 10:57:09,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:09,677 INFO L225 Difference]: With dead ends: 321 [2022-07-19 10:57:09,678 INFO L226 Difference]: Without dead ends: 319 [2022-07-19 10:57:09,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,679 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 42 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:09,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 170 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:09,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-19 10:57:09,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 253. [2022-07-19 10:57:09,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.7103174603174602) internal successors, (431), 252 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:09,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 431 transitions. [2022-07-19 10:57:09,688 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 431 transitions. Word has length 19 [2022-07-19 10:57:09,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:09,688 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 431 transitions. [2022-07-19 10:57:09,688 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) [2022-07-19 10:57:09,689 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 431 transitions. [2022-07-19 10:57:09,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 10:57:09,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:09,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:09,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 10:57:09,690 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:09,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:09,691 INFO L85 PathProgramCache]: Analyzing trace with hash 788890080, now seen corresponding path program 1 times [2022-07-19 10:57:09,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:09,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837355371] [2022-07-19 10:57:09,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:09,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:09,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:09,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837355371] [2022-07-19 10:57:09,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837355371] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:09,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:09,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:09,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16118062] [2022-07-19 10:57:09,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:09,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:09,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:09,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:09,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,723 INFO L87 Difference]: Start difference. First operand 253 states and 431 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:09,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:09,736 INFO L93 Difference]: Finished difference Result 469 states and 809 transitions. [2022-07-19 10:57:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:09,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-19 10:57:09,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:09,738 INFO L225 Difference]: With dead ends: 469 [2022-07-19 10:57:09,739 INFO L226 Difference]: Without dead ends: 467 [2022-07-19 10:57:09,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,741 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 39 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:09,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-07-19 10:57:09,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 353. [2022-07-19 10:57:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.6789772727272727) internal successors, (591), 352 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:09,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 591 transitions. [2022-07-19 10:57:09,754 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 591 transitions. Word has length 20 [2022-07-19 10:57:09,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:09,757 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 591 transitions. [2022-07-19 10:57:09,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:09,758 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 591 transitions. [2022-07-19 10:57:09,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 10:57:09,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:09,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:09,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 10:57:09,760 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:09,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:09,760 INFO L85 PathProgramCache]: Analyzing trace with hash 202084066, now seen corresponding path program 1 times [2022-07-19 10:57:09,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:09,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640144728] [2022-07-19 10:57:09,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:09,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:09,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:09,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640144728] [2022-07-19 10:57:09,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640144728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:09,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:09,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:09,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147821489] [2022-07-19 10:57:09,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:09,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:09,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:09,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:09,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,789 INFO L87 Difference]: Start difference. First operand 353 states and 591 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:09,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:09,804 INFO L93 Difference]: Finished difference Result 837 states and 1409 transitions. [2022-07-19 10:57:09,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:09,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-19 10:57:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:09,807 INFO L225 Difference]: With dead ends: 837 [2022-07-19 10:57:09,807 INFO L226 Difference]: Without dead ends: 491 [2022-07-19 10:57:09,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,809 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 45 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:09,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-07-19 10:57:09,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 489. [2022-07-19 10:57:09,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 1.6618852459016393) internal successors, (811), 488 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:09,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 811 transitions. [2022-07-19 10:57:09,821 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 811 transitions. Word has length 20 [2022-07-19 10:57:09,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:09,822 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 811 transitions. [2022-07-19 10:57:09,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:09,822 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 811 transitions. [2022-07-19 10:57:09,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 10:57:09,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:09,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:09,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 10:57:09,824 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:09,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:09,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1313996925, now seen corresponding path program 1 times [2022-07-19 10:57:09,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:09,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753510707] [2022-07-19 10:57:09,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:09,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:09,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:09,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753510707] [2022-07-19 10:57:09,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753510707] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:09,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:09,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:09,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698962044] [2022-07-19 10:57:09,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:09,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:09,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:09,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:09,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,876 INFO L87 Difference]: Start difference. First operand 489 states and 811 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:09,895 INFO L93 Difference]: Finished difference Result 741 states and 1225 transitions. [2022-07-19 10:57:09,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:09,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-19 10:57:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:09,898 INFO L225 Difference]: With dead ends: 741 [2022-07-19 10:57:09,898 INFO L226 Difference]: Without dead ends: 503 [2022-07-19 10:57:09,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,899 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 47 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:09,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:09,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-07-19 10:57:09,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2022-07-19 10:57:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.638) internal successors, (819), 500 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 819 transitions. [2022-07-19 10:57:09,920 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 819 transitions. Word has length 21 [2022-07-19 10:57:09,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:09,921 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 819 transitions. [2022-07-19 10:57:09,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 819 transitions. [2022-07-19 10:57:09,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 10:57:09,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:09,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:09,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 10:57:09,923 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:09,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:09,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1969853121, now seen corresponding path program 1 times [2022-07-19 10:57:09,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:09,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512285272] [2022-07-19 10:57:09,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:09,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:09,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:09,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512285272] [2022-07-19 10:57:09,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512285272] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:09,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:09,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:09,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616286010] [2022-07-19 10:57:09,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:09,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:09,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:09,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:09,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,944 INFO L87 Difference]: Start difference. First operand 501 states and 819 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:09,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:09,960 INFO L93 Difference]: Finished difference Result 905 states and 1501 transitions. [2022-07-19 10:57:09,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:09,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-19 10:57:09,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:09,965 INFO L225 Difference]: With dead ends: 905 [2022-07-19 10:57:09,965 INFO L226 Difference]: Without dead ends: 903 [2022-07-19 10:57:09,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:09,966 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 36 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:09,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 119 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2022-07-19 10:57:09,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 709. [2022-07-19 10:57:09,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 708 states have (on average 1.597457627118644) internal successors, (1131), 708 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1131 transitions. [2022-07-19 10:57:09,983 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1131 transitions. Word has length 21 [2022-07-19 10:57:09,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:09,983 INFO L495 AbstractCegarLoop]: Abstraction has 709 states and 1131 transitions. [2022-07-19 10:57:09,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:09,984 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1131 transitions. [2022-07-19 10:57:09,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 10:57:09,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:09,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:09,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 10:57:09,985 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:09,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:09,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1383047107, now seen corresponding path program 1 times [2022-07-19 10:57:09,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:09,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885258642] [2022-07-19 10:57:09,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:09,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:10,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:10,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885258642] [2022-07-19 10:57:10,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885258642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:10,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:10,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:10,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552365063] [2022-07-19 10:57:10,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:10,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:10,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:10,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:10,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:10,006 INFO L87 Difference]: Start difference. First operand 709 states and 1131 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:10,027 INFO L93 Difference]: Finished difference Result 1657 states and 2653 transitions. [2022-07-19 10:57:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:10,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-19 10:57:10,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:10,031 INFO L225 Difference]: With dead ends: 1657 [2022-07-19 10:57:10,031 INFO L226 Difference]: Without dead ends: 967 [2022-07-19 10:57:10,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:10,033 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 44 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:10,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 147 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:10,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2022-07-19 10:57:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 965. [2022-07-19 10:57:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.579875518672199) internal successors, (1523), 964 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1523 transitions. [2022-07-19 10:57:10,056 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1523 transitions. Word has length 21 [2022-07-19 10:57:10,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:10,057 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 1523 transitions. [2022-07-19 10:57:10,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,057 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1523 transitions. [2022-07-19 10:57:10,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 10:57:10,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:10,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:10,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 10:57:10,059 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:10,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:10,060 INFO L85 PathProgramCache]: Analyzing trace with hash 936119319, now seen corresponding path program 1 times [2022-07-19 10:57:10,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:10,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419518466] [2022-07-19 10:57:10,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:10,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:10,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:10,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419518466] [2022-07-19 10:57:10,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419518466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:10,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:10,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:10,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986721628] [2022-07-19 10:57:10,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:10,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:10,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:10,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:10,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:10,079 INFO L87 Difference]: Start difference. First operand 965 states and 1523 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:10,098 INFO L93 Difference]: Finished difference Result 1449 states and 2277 transitions. [2022-07-19 10:57:10,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:10,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-19 10:57:10,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:10,102 INFO L225 Difference]: With dead ends: 1449 [2022-07-19 10:57:10,102 INFO L226 Difference]: Without dead ends: 983 [2022-07-19 10:57:10,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:10,104 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 46 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 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 [2022-07-19 10:57:10,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:10,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2022-07-19 10:57:10,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 981. [2022-07-19 10:57:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 1.5540816326530613) internal successors, (1523), 980 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1523 transitions. [2022-07-19 10:57:10,126 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1523 transitions. Word has length 22 [2022-07-19 10:57:10,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:10,127 INFO L495 AbstractCegarLoop]: Abstraction has 981 states and 1523 transitions. [2022-07-19 10:57:10,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,127 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1523 transitions. [2022-07-19 10:57:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 10:57:10,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:10,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:10,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 10:57:10,129 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:10,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:10,129 INFO L85 PathProgramCache]: Analyzing trace with hash -74997931, now seen corresponding path program 1 times [2022-07-19 10:57:10,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:10,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060981550] [2022-07-19 10:57:10,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:10,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:10,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:10,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060981550] [2022-07-19 10:57:10,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060981550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:10,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:10,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:10,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597418852] [2022-07-19 10:57:10,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:10,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:10,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:10,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:10,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:10,148 INFO L87 Difference]: Start difference. First operand 981 states and 1523 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:10,182 INFO L93 Difference]: Finished difference Result 1737 states and 2741 transitions. [2022-07-19 10:57:10,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:10,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-19 10:57:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:10,188 INFO L225 Difference]: With dead ends: 1737 [2022-07-19 10:57:10,188 INFO L226 Difference]: Without dead ends: 1735 [2022-07-19 10:57:10,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:10,190 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 33 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:10,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 117 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:10,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-07-19 10:57:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1413. [2022-07-19 10:57:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1412 states have (on average 1.5092067988668556) internal successors, (2131), 1412 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2131 transitions. [2022-07-19 10:57:10,222 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2131 transitions. Word has length 22 [2022-07-19 10:57:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:10,222 INFO L495 AbstractCegarLoop]: Abstraction has 1413 states and 2131 transitions. [2022-07-19 10:57:10,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2131 transitions. [2022-07-19 10:57:10,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 10:57:10,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:10,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:10,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 10:57:10,225 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:10,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:10,225 INFO L85 PathProgramCache]: Analyzing trace with hash -661803945, now seen corresponding path program 1 times [2022-07-19 10:57:10,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:10,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778470392] [2022-07-19 10:57:10,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:10,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:10,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:10,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778470392] [2022-07-19 10:57:10,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778470392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:10,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:10,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:10,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999638228] [2022-07-19 10:57:10,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:10,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:10,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:10,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:10,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:10,243 INFO L87 Difference]: Start difference. First operand 1413 states and 2131 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:10,274 INFO L93 Difference]: Finished difference Result 3273 states and 4949 transitions. [2022-07-19 10:57:10,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:10,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-19 10:57:10,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:10,281 INFO L225 Difference]: With dead ends: 3273 [2022-07-19 10:57:10,281 INFO L226 Difference]: Without dead ends: 1895 [2022-07-19 10:57:10,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:10,284 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 43 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:10,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 148 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:10,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2022-07-19 10:57:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1893. [2022-07-19 10:57:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1892 states have (on average 1.4899577167019027) internal successors, (2819), 1892 states have internal predecessors, (2819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2819 transitions. [2022-07-19 10:57:10,343 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2819 transitions. Word has length 22 [2022-07-19 10:57:10,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:10,343 INFO L495 AbstractCegarLoop]: Abstraction has 1893 states and 2819 transitions. [2022-07-19 10:57:10,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2819 transitions. [2022-07-19 10:57:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 10:57:10,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:10,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:10,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 10:57:10,347 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:10,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:10,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1970246488, now seen corresponding path program 1 times [2022-07-19 10:57:10,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:10,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944630578] [2022-07-19 10:57:10,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:10,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:10,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:10,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944630578] [2022-07-19 10:57:10,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944630578] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:10,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:10,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:10,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582428879] [2022-07-19 10:57:10,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:10,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:10,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:10,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:10,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:10,392 INFO L87 Difference]: Start difference. First operand 1893 states and 2819 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:10,448 INFO L93 Difference]: Finished difference Result 2841 states and 4213 transitions. [2022-07-19 10:57:10,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:10,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-19 10:57:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:10,455 INFO L225 Difference]: With dead ends: 2841 [2022-07-19 10:57:10,455 INFO L226 Difference]: Without dead ends: 1927 [2022-07-19 10:57:10,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:10,459 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 45 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 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 [2022-07-19 10:57:10,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:10,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2022-07-19 10:57:10,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1925. [2022-07-19 10:57:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.4651767151767152) internal successors, (2819), 1924 states have internal predecessors, (2819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2819 transitions. [2022-07-19 10:57:10,514 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2819 transitions. Word has length 23 [2022-07-19 10:57:10,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:10,515 INFO L495 AbstractCegarLoop]: Abstraction has 1925 states and 2819 transitions. [2022-07-19 10:57:10,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2819 transitions. [2022-07-19 10:57:10,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 10:57:10,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:10,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:10,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 10:57:10,518 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:10,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:10,519 INFO L85 PathProgramCache]: Analyzing trace with hash 959129238, now seen corresponding path program 1 times [2022-07-19 10:57:10,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:10,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748364500] [2022-07-19 10:57:10,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:10,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:10,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:10,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748364500] [2022-07-19 10:57:10,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748364500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:10,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:10,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:10,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268014135] [2022-07-19 10:57:10,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:10,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:10,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:10,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:10,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:10,539 INFO L87 Difference]: Start difference. First operand 1925 states and 2819 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:10,581 INFO L93 Difference]: Finished difference Result 3337 states and 4965 transitions. [2022-07-19 10:57:10,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:10,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-19 10:57:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:10,593 INFO L225 Difference]: With dead ends: 3337 [2022-07-19 10:57:10,594 INFO L226 Difference]: Without dead ends: 3335 [2022-07-19 10:57:10,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:10,596 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 30 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:10,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 115 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2022-07-19 10:57:10,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 2821. [2022-07-19 10:57:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2821 states, 2820 states have (on average 1.4195035460992909) internal successors, (4003), 2820 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 4003 transitions. [2022-07-19 10:57:10,672 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 4003 transitions. Word has length 23 [2022-07-19 10:57:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:10,673 INFO L495 AbstractCegarLoop]: Abstraction has 2821 states and 4003 transitions. [2022-07-19 10:57:10,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 4003 transitions. [2022-07-19 10:57:10,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 10:57:10,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:10,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:10,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 10:57:10,693 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:10,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash 372323224, now seen corresponding path program 1 times [2022-07-19 10:57:10,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:10,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91040357] [2022-07-19 10:57:10,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:10,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:10,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:10,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91040357] [2022-07-19 10:57:10,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91040357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:10,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:10,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:10,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411650634] [2022-07-19 10:57:10,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:10,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:10,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:10,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:10,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:10,720 INFO L87 Difference]: Start difference. First operand 2821 states and 4003 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:10,783 INFO L93 Difference]: Finished difference Result 6473 states and 9189 transitions. [2022-07-19 10:57:10,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:10,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-19 10:57:10,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:10,795 INFO L225 Difference]: With dead ends: 6473 [2022-07-19 10:57:10,795 INFO L226 Difference]: Without dead ends: 3719 [2022-07-19 10:57:10,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:10,800 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 42 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:10,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 149 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:10,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2022-07-19 10:57:10,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3717. [2022-07-19 10:57:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3717 states, 3716 states have (on average 1.3958557588805167) internal successors, (5187), 3716 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3717 states to 3717 states and 5187 transitions. [2022-07-19 10:57:10,907 INFO L78 Accepts]: Start accepts. Automaton has 3717 states and 5187 transitions. Word has length 23 [2022-07-19 10:57:10,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:10,907 INFO L495 AbstractCegarLoop]: Abstraction has 3717 states and 5187 transitions. [2022-07-19 10:57:10,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3717 states and 5187 transitions. [2022-07-19 10:57:10,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:57:10,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:10,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:10,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 10:57:10,912 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:10,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:10,913 INFO L85 PathProgramCache]: Analyzing trace with hash -331549300, now seen corresponding path program 1 times [2022-07-19 10:57:10,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:10,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098385625] [2022-07-19 10:57:10,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:10,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:10,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:10,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098385625] [2022-07-19 10:57:10,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098385625] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:10,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:10,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:10,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389008278] [2022-07-19 10:57:10,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:10,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:10,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:10,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:10,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:10,935 INFO L87 Difference]: Start difference. First operand 3717 states and 5187 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:11,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:11,014 INFO L93 Difference]: Finished difference Result 5577 states and 7749 transitions. [2022-07-19 10:57:11,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:11,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-19 10:57:11,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:11,037 INFO L225 Difference]: With dead ends: 5577 [2022-07-19 10:57:11,038 INFO L226 Difference]: Without dead ends: 3783 [2022-07-19 10:57:11,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:11,041 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 44 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:11,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 136 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2022-07-19 10:57:11,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3781. [2022-07-19 10:57:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3781 states, 3780 states have (on average 1.3722222222222222) internal successors, (5187), 3780 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 5187 transitions. [2022-07-19 10:57:11,145 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 5187 transitions. Word has length 24 [2022-07-19 10:57:11,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:11,146 INFO L495 AbstractCegarLoop]: Abstraction has 3781 states and 5187 transitions. [2022-07-19 10:57:11,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 5187 transitions. [2022-07-19 10:57:11,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:57:11,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:11,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:11,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 10:57:11,151 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:11,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:11,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1342666550, now seen corresponding path program 1 times [2022-07-19 10:57:11,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:11,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225624661] [2022-07-19 10:57:11,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:11,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:11,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:11,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:11,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225624661] [2022-07-19 10:57:11,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225624661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:11,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:11,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:11,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568041114] [2022-07-19 10:57:11,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:11,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:11,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:11,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:11,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:11,175 INFO L87 Difference]: Start difference. First operand 3781 states and 5187 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:11,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:11,256 INFO L93 Difference]: Finished difference Result 6409 states and 8901 transitions. [2022-07-19 10:57:11,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:11,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-19 10:57:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:11,304 INFO L225 Difference]: With dead ends: 6409 [2022-07-19 10:57:11,304 INFO L226 Difference]: Without dead ends: 6407 [2022-07-19 10:57:11,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:11,308 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 27 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 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 [2022-07-19 10:57:11,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:11,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6407 states. [2022-07-19 10:57:11,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6407 to 5637. [2022-07-19 10:57:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5637 states, 5636 states have (on average 1.3291341376863024) internal successors, (7491), 5636 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 7491 transitions. [2022-07-19 10:57:11,462 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 7491 transitions. Word has length 24 [2022-07-19 10:57:11,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:11,462 INFO L495 AbstractCegarLoop]: Abstraction has 5637 states and 7491 transitions. [2022-07-19 10:57:11,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 7491 transitions. [2022-07-19 10:57:11,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:57:11,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:11,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:11,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 10:57:11,472 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:11,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1929472564, now seen corresponding path program 1 times [2022-07-19 10:57:11,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:11,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358858659] [2022-07-19 10:57:11,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:11,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:11,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:11,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358858659] [2022-07-19 10:57:11,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358858659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:11,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:11,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:11,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913109929] [2022-07-19 10:57:11,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:11,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:11,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:11,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:11,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:11,500 INFO L87 Difference]: Start difference. First operand 5637 states and 7491 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:11,619 INFO L93 Difference]: Finished difference Result 12809 states and 16965 transitions. [2022-07-19 10:57:11,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:11,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-19 10:57:11,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:11,635 INFO L225 Difference]: With dead ends: 12809 [2022-07-19 10:57:11,636 INFO L226 Difference]: Without dead ends: 7303 [2022-07-19 10:57:11,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:11,644 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 41 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:11,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:11,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7303 states. [2022-07-19 10:57:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7303 to 7301. [2022-07-19 10:57:11,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7301 states, 7300 states have (on average 1.297945205479452) internal successors, (9475), 7300 states have internal predecessors, (9475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7301 states to 7301 states and 9475 transitions. [2022-07-19 10:57:11,813 INFO L78 Accepts]: Start accepts. Automaton has 7301 states and 9475 transitions. Word has length 24 [2022-07-19 10:57:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:11,813 INFO L495 AbstractCegarLoop]: Abstraction has 7301 states and 9475 transitions. [2022-07-19 10:57:11,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 7301 states and 9475 transitions. [2022-07-19 10:57:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 10:57:11,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:11,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:11,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 10:57:11,822 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:11,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:11,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1327225645, now seen corresponding path program 1 times [2022-07-19 10:57:11,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:11,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839978151] [2022-07-19 10:57:11,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:11,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:11,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:11,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:11,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839978151] [2022-07-19 10:57:11,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839978151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:11,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:11,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:11,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119455602] [2022-07-19 10:57:11,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:11,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:11,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:11,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:11,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:11,865 INFO L87 Difference]: Start difference. First operand 7301 states and 9475 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:11,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:11,949 INFO L93 Difference]: Finished difference Result 10953 states and 14149 transitions. [2022-07-19 10:57:11,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:11,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-19 10:57:11,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:11,964 INFO L225 Difference]: With dead ends: 10953 [2022-07-19 10:57:11,965 INFO L226 Difference]: Without dead ends: 7431 [2022-07-19 10:57:11,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:11,973 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 43 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 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 [2022-07-19 10:57:11,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 132 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:11,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2022-07-19 10:57:12,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 7429. [2022-07-19 10:57:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7429 states, 7428 states have (on average 1.2755788906838987) internal successors, (9475), 7428 states have internal predecessors, (9475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 9475 transitions. [2022-07-19 10:57:12,175 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 9475 transitions. Word has length 25 [2022-07-19 10:57:12,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:12,176 INFO L495 AbstractCegarLoop]: Abstraction has 7429 states and 9475 transitions. [2022-07-19 10:57:12,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:12,176 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 9475 transitions. [2022-07-19 10:57:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 10:57:12,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:12,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:12,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 10:57:12,184 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:12,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:12,185 INFO L85 PathProgramCache]: Analyzing trace with hash 316108395, now seen corresponding path program 1 times [2022-07-19 10:57:12,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:12,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457235722] [2022-07-19 10:57:12,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:12,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:12,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:12,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457235722] [2022-07-19 10:57:12,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457235722] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:12,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:12,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:12,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613801790] [2022-07-19 10:57:12,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:12,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:12,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:12,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:12,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:12,201 INFO L87 Difference]: Start difference. First operand 7429 states and 9475 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:12,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:12,315 INFO L93 Difference]: Finished difference Result 12297 states and 15749 transitions. [2022-07-19 10:57:12,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:12,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-19 10:57:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:12,344 INFO L225 Difference]: With dead ends: 12297 [2022-07-19 10:57:12,344 INFO L226 Difference]: Without dead ends: 12295 [2022-07-19 10:57:12,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:12,351 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 24 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:12,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 111 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:12,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12295 states. [2022-07-19 10:57:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12295 to 11269. [2022-07-19 10:57:12,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11269 states, 11268 states have (on average 1.238462903798367) internal successors, (13955), 11268 states have internal predecessors, (13955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 13955 transitions. [2022-07-19 10:57:12,597 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 13955 transitions. Word has length 25 [2022-07-19 10:57:12,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:12,598 INFO L495 AbstractCegarLoop]: Abstraction has 11269 states and 13955 transitions. [2022-07-19 10:57:12,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:12,598 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 13955 transitions. [2022-07-19 10:57:12,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 10:57:12,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:12,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:12,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 10:57:12,614 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:12,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:12,615 INFO L85 PathProgramCache]: Analyzing trace with hash -270697619, now seen corresponding path program 1 times [2022-07-19 10:57:12,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:12,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187793704] [2022-07-19 10:57:12,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:12,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:12,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:12,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187793704] [2022-07-19 10:57:12,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187793704] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:12,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:12,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:12,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812150572] [2022-07-19 10:57:12,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:12,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:12,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:12,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:12,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:12,660 INFO L87 Difference]: Start difference. First operand 11269 states and 13955 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:12,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:12,862 INFO L93 Difference]: Finished difference Result 25353 states and 31109 transitions. [2022-07-19 10:57:12,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:12,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-19 10:57:12,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:12,893 INFO L225 Difference]: With dead ends: 25353 [2022-07-19 10:57:12,893 INFO L226 Difference]: Without dead ends: 14343 [2022-07-19 10:57:12,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:12,912 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 40 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:12,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 151 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:12,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14343 states. [2022-07-19 10:57:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14343 to 14341. [2022-07-19 10:57:13,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14341 states, 14340 states have (on average 1.1963040446304045) internal successors, (17155), 14340 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14341 states to 14341 states and 17155 transitions. [2022-07-19 10:57:13,306 INFO L78 Accepts]: Start accepts. Automaton has 14341 states and 17155 transitions. Word has length 25 [2022-07-19 10:57:13,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:13,306 INFO L495 AbstractCegarLoop]: Abstraction has 14341 states and 17155 transitions. [2022-07-19 10:57:13,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 14341 states and 17155 transitions. [2022-07-19 10:57:13,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 10:57:13,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:13,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:13,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-19 10:57:13,324 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:13,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:13,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1209641729, now seen corresponding path program 1 times [2022-07-19 10:57:13,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:13,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952259259] [2022-07-19 10:57:13,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:13,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:13,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:13,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952259259] [2022-07-19 10:57:13,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952259259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:13,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:13,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:13,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689214451] [2022-07-19 10:57:13,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:13,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:13,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:13,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:13,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:13,347 INFO L87 Difference]: Start difference. First operand 14341 states and 17155 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:13,502 INFO L93 Difference]: Finished difference Result 21513 states and 25605 transitions. [2022-07-19 10:57:13,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:13,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-19 10:57:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:13,534 INFO L225 Difference]: With dead ends: 21513 [2022-07-19 10:57:13,535 INFO L226 Difference]: Without dead ends: 14599 [2022-07-19 10:57:13,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:13,549 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 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 [2022-07-19 10:57:13,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:13,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14599 states. [2022-07-19 10:57:13,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14599 to 14597. [2022-07-19 10:57:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14597 states, 14596 states have (on average 1.175322006029049) internal successors, (17155), 14596 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14597 states to 14597 states and 17155 transitions. [2022-07-19 10:57:13,898 INFO L78 Accepts]: Start accepts. Automaton has 14597 states and 17155 transitions. Word has length 26 [2022-07-19 10:57:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:13,898 INFO L495 AbstractCegarLoop]: Abstraction has 14597 states and 17155 transitions. [2022-07-19 10:57:13,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:13,899 INFO L276 IsEmpty]: Start isEmpty. Operand 14597 states and 17155 transitions. [2022-07-19 10:57:13,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 10:57:13,974 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:13,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:13,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 10:57:13,974 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:13,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:13,974 INFO L85 PathProgramCache]: Analyzing trace with hash 198524479, now seen corresponding path program 1 times [2022-07-19 10:57:13,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:13,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298428527] [2022-07-19 10:57:13,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:13,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:13,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:13,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298428527] [2022-07-19 10:57:13,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298428527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:13,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:13,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:13,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864793118] [2022-07-19 10:57:13,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:13,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:13,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:13,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:13,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:13,996 INFO L87 Difference]: Start difference. First operand 14597 states and 17155 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:14,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:14,215 INFO L93 Difference]: Finished difference Result 23559 states and 27396 transitions. [2022-07-19 10:57:14,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:14,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-19 10:57:14,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:14,302 INFO L225 Difference]: With dead ends: 23559 [2022-07-19 10:57:14,302 INFO L226 Difference]: Without dead ends: 23557 [2022-07-19 10:57:14,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:14,307 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 20 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:14,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 108 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:14,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23557 states. [2022-07-19 10:57:14,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23557 to 22533. [2022-07-19 10:57:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22533 states, 22532 states have (on average 1.1476566660749157) internal successors, (25859), 22532 states have internal predecessors, (25859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22533 states to 22533 states and 25859 transitions. [2022-07-19 10:57:14,703 INFO L78 Accepts]: Start accepts. Automaton has 22533 states and 25859 transitions. Word has length 26 [2022-07-19 10:57:14,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:14,703 INFO L495 AbstractCegarLoop]: Abstraction has 22533 states and 25859 transitions. [2022-07-19 10:57:14,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 22533 states and 25859 transitions. [2022-07-19 10:57:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 10:57:14,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:14,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:14,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-19 10:57:14,736 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:14,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:14,737 INFO L85 PathProgramCache]: Analyzing trace with hash -388281535, now seen corresponding path program 1 times [2022-07-19 10:57:14,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:14,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744271459] [2022-07-19 10:57:14,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:14,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:14,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:14,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:14,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744271459] [2022-07-19 10:57:14,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744271459] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:14,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:14,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:14,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338753033] [2022-07-19 10:57:14,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:14,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:14,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:14,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:14,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:14,759 INFO L87 Difference]: Start difference. First operand 22533 states and 25859 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:15,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:15,131 INFO L93 Difference]: Finished difference Result 50181 states and 56579 transitions. [2022-07-19 10:57:15,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:15,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-19 10:57:15,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:15,132 INFO L225 Difference]: With dead ends: 50181 [2022-07-19 10:57:15,132 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 10:57:15,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:15,168 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 38 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:15,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:15,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 10:57:15,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 10:57:15,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 10:57:15,169 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-07-19 10:57:15,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:15,169 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 10:57:15,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 10:57:15,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 10:57:15,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 10:57:15,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-19 10:57:15,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 10:57:15,186 INFO L899 garLoopResultBuilder]: For program point L126(line 126) no Hoare annotation was computed. [2022-07-19 10:57:15,186 INFO L899 garLoopResultBuilder]: For program point L151(line 151) no Hoare annotation was computed. [2022-07-19 10:57:15,186 INFO L899 garLoopResultBuilder]: For program point L110-1(lines 41 160) no Hoare annotation was computed. [2022-07-19 10:57:15,186 INFO L899 garLoopResultBuilder]: For program point L135-1(lines 41 160) no Hoare annotation was computed. [2022-07-19 10:57:15,186 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 10:57:15,186 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 10:57:15,187 INFO L899 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-07-19 10:57:15,187 INFO L899 garLoopResultBuilder]: For program point L136(line 136) no Hoare annotation was computed. [2022-07-19 10:57:15,187 INFO L902 garLoopResultBuilder]: At program point L161(lines 7 165) the Hoare annotation is: true [2022-07-19 10:57:15,187 INFO L899 garLoopResultBuilder]: For program point L120-1(lines 41 160) no Hoare annotation was computed. [2022-07-19 10:57:15,187 INFO L899 garLoopResultBuilder]: For program point L145-1(lines 41 160) no Hoare annotation was computed. [2022-07-19 10:57:15,187 INFO L899 garLoopResultBuilder]: For program point L104-1(lines 41 160) no Hoare annotation was computed. [2022-07-19 10:57:15,187 INFO L899 garLoopResultBuilder]: For program point L96-1(lines 41 160) no Hoare annotation was computed. [2022-07-19 10:57:15,188 INFO L899 garLoopResultBuilder]: For program point L121(line 121) no Hoare annotation was computed. [2022-07-19 10:57:15,188 INFO L899 garLoopResultBuilder]: For program point L88-1(lines 41 160) no Hoare annotation was computed. [2022-07-19 10:57:15,188 INFO L899 garLoopResultBuilder]: For program point L146(line 146) no Hoare annotation was computed. [2022-07-19 10:57:15,188 INFO L899 garLoopResultBuilder]: For program point L80-1(lines 41 160) no Hoare annotation was computed. [2022-07-19 10:57:15,188 INFO L899 garLoopResultBuilder]: For program point L72-1(lines 41 160) no Hoare annotation was computed. [2022-07-19 10:57:15,188 INFO L899 garLoopResultBuilder]: For program point L130-1(lines 41 160) no Hoare annotation was computed. [2022-07-19 10:57:15,188 INFO L902 garLoopResultBuilder]: At program point L155-1(lines 41 160) the Hoare annotation is: true [2022-07-19 10:57:15,188 INFO L902 garLoopResultBuilder]: At program point L164(lines 6 165) the Hoare annotation is: true [2022-07-19 10:57:15,189 INFO L899 garLoopResultBuilder]: For program point L131(line 131) no Hoare annotation was computed. [2022-07-19 10:57:15,189 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 10:57:15,189 INFO L899 garLoopResultBuilder]: For program point L156(line 156) no Hoare annotation was computed. [2022-07-19 10:57:15,189 INFO L895 garLoopResultBuilder]: At program point L156-1(lines 7 165) the Hoare annotation is: false [2022-07-19 10:57:15,189 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 163) no Hoare annotation was computed. [2022-07-19 10:57:15,189 INFO L899 garLoopResultBuilder]: For program point L115-1(lines 41 160) no Hoare annotation was computed. [2022-07-19 10:57:15,189 INFO L899 garLoopResultBuilder]: For program point L140-1(lines 41 160) no Hoare annotation was computed. [2022-07-19 10:57:15,190 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 10:57:15,190 INFO L899 garLoopResultBuilder]: For program point L116(line 116) no Hoare annotation was computed. [2022-07-19 10:57:15,190 INFO L899 garLoopResultBuilder]: For program point L141(line 141) no Hoare annotation was computed. [2022-07-19 10:57:15,190 INFO L899 garLoopResultBuilder]: For program point L100-1(lines 41 160) no Hoare annotation was computed. [2022-07-19 10:57:15,190 INFO L899 garLoopResultBuilder]: For program point L125-1(lines 41 160) no Hoare annotation was computed. [2022-07-19 10:57:15,190 INFO L899 garLoopResultBuilder]: For program point L92-1(lines 41 160) no Hoare annotation was computed. [2022-07-19 10:57:15,190 INFO L899 garLoopResultBuilder]: For program point L150-1(lines 41 160) no Hoare annotation was computed. [2022-07-19 10:57:15,190 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 41 160) no Hoare annotation was computed. [2022-07-19 10:57:15,191 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 45) no Hoare annotation was computed. [2022-07-19 10:57:15,191 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 41 160) no Hoare annotation was computed. [2022-07-19 10:57:15,191 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 70) no Hoare annotation was computed. [2022-07-19 10:57:15,191 INFO L899 garLoopResultBuilder]: For program point L68-2(lines 41 160) no Hoare annotation was computed. [2022-07-19 10:57:15,194 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:15,196 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 10:57:15,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:57:15 BoogieIcfgContainer [2022-07-19 10:57:15,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 10:57:15,203 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 10:57:15,203 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 10:57:15,203 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 10:57:15,204 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:57:08" (3/4) ... [2022-07-19 10:57:15,206 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 10:57:15,214 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-19 10:57:15,215 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-19 10:57:15,215 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 10:57:15,215 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 10:57:15,246 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 10:57:15,247 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 10:57:15,247 INFO L158 Benchmark]: Toolchain (without parser) took 7603.43ms. Allocated memory was 96.5MB in the beginning and 809.5MB in the end (delta: 713.0MB). Free memory was 63.4MB in the beginning and 519.4MB in the end (delta: -456.0MB). Peak memory consumption was 257.2MB. Max. memory is 16.1GB. [2022-07-19 10:57:15,247 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 96.5MB. Free memory was 54.8MB in the beginning and 54.8MB in the end (delta: 39.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:57:15,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.44ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 63.1MB in the beginning and 102.8MB in the end (delta: -39.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 10:57:15,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.56ms. Allocated memory is still 127.9MB. Free memory was 102.8MB in the beginning and 101.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:57:15,248 INFO L158 Benchmark]: Boogie Preprocessor took 42.15ms. Allocated memory is still 127.9MB. Free memory was 101.1MB in the beginning and 99.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 10:57:15,248 INFO L158 Benchmark]: RCFGBuilder took 413.88ms. Allocated memory is still 127.9MB. Free memory was 99.7MB in the beginning and 87.2MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 10:57:15,249 INFO L158 Benchmark]: TraceAbstraction took 6734.29ms. Allocated memory was 127.9MB in the beginning and 809.5MB in the end (delta: 681.6MB). Free memory was 86.4MB in the beginning and 523.6MB in the end (delta: -437.1MB). Peak memory consumption was 247.6MB. Max. memory is 16.1GB. [2022-07-19 10:57:15,249 INFO L158 Benchmark]: Witness Printer took 43.69ms. Allocated memory is still 809.5MB. Free memory was 523.6MB in the beginning and 519.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 10:57:15,250 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 96.5MB. Free memory was 54.8MB in the beginning and 54.8MB in the end (delta: 39.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.44ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 63.1MB in the beginning and 102.8MB in the end (delta: -39.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.56ms. Allocated memory is still 127.9MB. Free memory was 102.8MB in the beginning and 101.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.15ms. Allocated memory is still 127.9MB. Free memory was 101.1MB in the beginning and 99.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 413.88ms. Allocated memory is still 127.9MB. Free memory was 99.7MB in the beginning and 87.2MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6734.29ms. Allocated memory was 127.9MB in the beginning and 809.5MB in the end (delta: 681.6MB). Free memory was 86.4MB in the beginning and 523.6MB in the end (delta: -437.1MB). Peak memory consumption was 247.6MB. Max. memory is 16.1GB. * Witness Printer took 43.69ms. Allocated memory is still 809.5MB. Free memory was 523.6MB in the beginning and 519.4MB 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: 163]: 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, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1149 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1149 mSDsluCounter, 3837 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1533 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 149 IncrementalHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 2304 mSDtfsCounter, 149 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22533occurred in iteration=27, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 1033 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 608 NumberOfCodeBlocks, 608 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 580 ConstructedInterpolants, 0 QuantifiedInterpolants, 1240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-19 10:57:15,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE