/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-87fd7473a0bda1db0ad7f77f2116346063730f21-87fd747 [2021-08-21 17:12:53,253 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-21 17:12:53,255 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-21 17:12:53,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-21 17:12:53,295 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-21 17:12:53,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-21 17:12:53,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-21 17:12:53,304 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-21 17:12:53,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-21 17:12:53,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-21 17:12:53,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-21 17:12:53,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-21 17:12:53,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-21 17:12:53,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-21 17:12:53,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-21 17:12:53,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-21 17:12:53,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-21 17:12:53,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-21 17:12:53,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-21 17:12:53,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-21 17:12:53,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-21 17:12:53,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-21 17:12:53,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-21 17:12:53,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-21 17:12:53,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-21 17:12:53,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-21 17:12:53,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-21 17:12:53,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-21 17:12:53,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-21 17:12:53,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-21 17:12:53,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-21 17:12:53,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-21 17:12:53,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-21 17:12:53,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-21 17:12:53,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-21 17:12:53,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-21 17:12:53,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-21 17:12:53,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-21 17:12:53,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-21 17:12:53,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-21 17:12:53,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-21 17:12:53,336 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf [2021-08-21 17:12:53,354 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-21 17:12:53,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-21 17:12:53,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-21 17:12:53,355 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-21 17:12:53,355 INFO L138 SettingsManager]: * Use SBE=true [2021-08-21 17:12:53,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-21 17:12:53,356 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-21 17:12:53,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-21 17:12:53,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-21 17:12:53,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-21 17:12:53,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-21 17:12:53,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-21 17:12:53,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-21 17:12:53,357 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-21 17:12:53,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-21 17:12:53,357 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-21 17:12:53,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-21 17:12:53,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-21 17:12:53,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-21 17:12:53,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-21 17:12:53,358 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-21 17:12:53,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 17:12:53,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-21 17:12:53,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-21 17:12:53,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-21 17:12:53,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-21 17:12:53,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-21 17:12:53,359 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-21 17:12:53,359 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-21 17:12:53,359 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-08-21 17:12:53,359 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 [2021-08-21 17:12:53,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-21 17:12:53,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-21 17:12:53,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-21 17:12:53,683 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-21 17:12:53,683 INFO L275 PluginConnector]: CDTParser initialized [2021-08-21 17:12:53,684 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2021-08-21 17:12:53,761 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01a70832d/a9f5d4172b0b49348b3b1a8c9bae370b/FLAG42801c4fd [2021-08-21 17:12:54,338 INFO L306 CDTParser]: Found 1 translation units. [2021-08-21 17:12:54,339 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2021-08-21 17:12:54,386 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01a70832d/a9f5d4172b0b49348b3b1a8c9bae370b/FLAG42801c4fd [2021-08-21 17:12:54,621 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01a70832d/a9f5d4172b0b49348b3b1a8c9bae370b [2021-08-21 17:12:54,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-21 17:12:54,625 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-21 17:12:54,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-21 17:12:54,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-21 17:12:54,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-21 17:12:54,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:12:54" (1/1) ... [2021-08-21 17:12:54,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b394ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:54, skipping insertion in model container [2021-08-21 17:12:54,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:12:54" (1/1) ... [2021-08-21 17:12:54,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-21 17:12:54,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-21 17:12:55,228 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i[76077,76090] [2021-08-21 17:12:55,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 17:12:55,282 INFO L203 MainTranslator]: Completed pre-run [2021-08-21 17:12:55,319 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i[76077,76090] [2021-08-21 17:12:55,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 17:12:55,412 INFO L208 MainTranslator]: Completed translation [2021-08-21 17:12:55,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55 WrapperNode [2021-08-21 17:12:55,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-21 17:12:55,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-21 17:12:55,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-21 17:12:55,413 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-21 17:12:55,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:55,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:55,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-21 17:12:55,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-21 17:12:55,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-21 17:12:55,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-21 17:12:55,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:55,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:55,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:55,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:55,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:55,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:55,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:55,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-21 17:12:55,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-21 17:12:55,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-21 17:12:55,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-21 17:12:55,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (1/1) ... [2021-08-21 17:12:55,502 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 17:12:55,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 17:12:55,524 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) [2021-08-21 17:12:55,536 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 [2021-08-21 17:12:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-21 17:12:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-21 17:12:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-08-21 17:12:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-21 17:12:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-21 17:12:55,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-21 17:12:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-08-21 17:12:55,567 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-08-21 17:12:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-21 17:12:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-21 17:12:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-21 17:12:55,569 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-21 17:12:56,017 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-21 17:12:56,017 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-08-21 17:12:56,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:12:56 BoogieIcfgContainer [2021-08-21 17:12:56,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-21 17:12:56,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-21 17:12:56,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-21 17:12:56,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-21 17:12:56,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 05:12:54" (1/3) ... [2021-08-21 17:12:56,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e8e242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:12:56, skipping insertion in model container [2021-08-21 17:12:56,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:55" (2/3) ... [2021-08-21 17:12:56,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e8e242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:12:56, skipping insertion in model container [2021-08-21 17:12:56,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:12:56" (3/3) ... [2021-08-21 17:12:56,024 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2021-08-21 17:12:56,027 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-21 17:12:56,027 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-21 17:12:56,027 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-08-21 17:12:56,028 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-21 17:12:56,051 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,051 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,051 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,051 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,051 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,051 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,052 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,052 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,052 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,052 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,052 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,052 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,052 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,052 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,052 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,052 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,053 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,053 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,053 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,053 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,053 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,053 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,053 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,053 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,053 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,053 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,053 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,054 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,054 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,054 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,054 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,054 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,054 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,054 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,054 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,054 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,054 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,054 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,055 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,055 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,055 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,055 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,055 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,055 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,055 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,055 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,055 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,055 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,056 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,056 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,056 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,056 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,056 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,056 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,056 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,056 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,056 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,057 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,057 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,057 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,057 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,057 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,057 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,057 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,057 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,057 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,058 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,058 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,058 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,058 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,058 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,058 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,058 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,058 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,058 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,058 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,059 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,059 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,059 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,059 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,059 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,059 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,059 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,059 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,059 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,059 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,059 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,060 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,060 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,060 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,060 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,060 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,060 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,060 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,060 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,060 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,060 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,060 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,061 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,061 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,061 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,061 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,061 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,061 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,061 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,061 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,061 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,061 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,061 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,062 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,062 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,062 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,062 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,062 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,062 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,062 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,062 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,062 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,062 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,063 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,063 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,063 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,063 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,063 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,063 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,063 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,063 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,063 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,063 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,064 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,064 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,064 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,064 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,064 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,064 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,064 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,064 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,064 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,065 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,065 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,067 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,067 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,067 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,067 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,067 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,067 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,068 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,068 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,068 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,068 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,068 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,068 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,072 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,072 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,072 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,072 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,072 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,072 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,073 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,073 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,073 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,073 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,073 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,073 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:56,078 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-08-21 17:12:56,103 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-21 17:12:56,107 INFO L339 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, mConcurrency=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-08-21 17:12:56,107 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-08-21 17:13:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 9274 states, 8669 states have (on average 1.4291152382050987) internal successors, (12389), 9273 states have internal predecessors, (12389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:56,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-21 17:13:56,771 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:13:56,771 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:13:56,772 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:13:56,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:13:56,775 INFO L82 PathProgramCache]: Analyzing trace with hash -988927327, now seen corresponding path program 1 times [2021-08-21 17:13:56,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:13:56,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865749785] [2021-08-21 17:13:56,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:13:56,781 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:13:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:13:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:13:57,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:13:57,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865749785] [2021-08-21 17:13:57,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865749785] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:13:57,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:13:57,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:13:57,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383684515] [2021-08-21 17:13:57,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:13:57,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:13:57,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:13:57,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:13:57,300 INFO L87 Difference]: Start difference. First operand has 9274 states, 8669 states have (on average 1.4291152382050987) internal successors, (12389), 9273 states have internal predecessors, (12389), 0 states have call successors, (0), 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 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:57,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:13:57,537 INFO L93 Difference]: Finished difference Result 8818 states and 11656 transitions. [2021-08-21 17:13:57,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 17:13:57,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-08-21 17:13:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:13:57,572 INFO L225 Difference]: With dead ends: 8818 [2021-08-21 17:13:57,573 INFO L226 Difference]: Without dead ends: 3773 [2021-08-21 17:13:57,574 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 67.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:13:57,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3773 states. [2021-08-21 17:13:57,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3773 to 3772. [2021-08-21 17:13:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3772 states, 3737 states have (on average 1.4195879047364195) internal successors, (5305), 3771 states have internal predecessors, (5305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:57,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3772 states to 3772 states and 5305 transitions. [2021-08-21 17:13:57,732 INFO L78 Accepts]: Start accepts. Automaton has 3772 states and 5305 transitions. Word has length 36 [2021-08-21 17:13:57,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:13:57,732 INFO L470 AbstractCegarLoop]: Abstraction has 3772 states and 5305 transitions. [2021-08-21 17:13:57,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:57,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3772 states and 5305 transitions. [2021-08-21 17:13:57,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-21 17:13:57,733 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:13:57,734 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:13:57,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-21 17:13:57,734 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:13:57,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:13:57,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1449842663, now seen corresponding path program 1 times [2021-08-21 17:13:57,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:13:57,737 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009805518] [2021-08-21 17:13:57,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:13:57,738 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:13:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:13:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:13:57,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:13:57,879 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009805518] [2021-08-21 17:13:57,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009805518] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:13:57,879 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:13:57,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:13:57,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32905345] [2021-08-21 17:13:57,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:13:57,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:13:57,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:13:57,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:13:57,881 INFO L87 Difference]: Start difference. First operand 3772 states and 5305 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:58,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:13:58,007 INFO L93 Difference]: Finished difference Result 3774 states and 5307 transitions. [2021-08-21 17:13:58,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-21 17:13:58,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2021-08-21 17:13:58,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:13:58,018 INFO L225 Difference]: With dead ends: 3774 [2021-08-21 17:13:58,018 INFO L226 Difference]: Without dead ends: 3774 [2021-08-21 17:13:58,018 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 61.8ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-08-21 17:13:58,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3774 states. [2021-08-21 17:13:58,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3774 to 3770. [2021-08-21 17:13:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3770 states, 3736 states have (on average 1.4194325481798715) internal successors, (5303), 3769 states have internal predecessors, (5303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3770 states to 3770 states and 5303 transitions. [2021-08-21 17:13:58,096 INFO L78 Accepts]: Start accepts. Automaton has 3770 states and 5303 transitions. Word has length 42 [2021-08-21 17:13:58,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:13:58,096 INFO L470 AbstractCegarLoop]: Abstraction has 3770 states and 5303 transitions. [2021-08-21 17:13:58,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:58,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3770 states and 5303 transitions. [2021-08-21 17:13:58,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-21 17:13:58,098 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:13:58,098 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:13:58,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-21 17:13:58,098 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:13:58,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:13:58,099 INFO L82 PathProgramCache]: Analyzing trace with hash 53531805, now seen corresponding path program 1 times [2021-08-21 17:13:58,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:13:58,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733332512] [2021-08-21 17:13:58,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:13:58,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:13:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:13:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:13:58,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:13:58,173 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733332512] [2021-08-21 17:13:58,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733332512] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:13:58,173 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:13:58,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:13:58,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196230123] [2021-08-21 17:13:58,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:13:58,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:13:58,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:13:58,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:13:58,174 INFO L87 Difference]: Start difference. First operand 3770 states and 5303 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:13:58,443 INFO L93 Difference]: Finished difference Result 6061 states and 9020 transitions. [2021-08-21 17:13:58,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-21 17:13:58,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2021-08-21 17:13:58,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:13:58,462 INFO L225 Difference]: With dead ends: 6061 [2021-08-21 17:13:58,462 INFO L226 Difference]: Without dead ends: 6061 [2021-08-21 17:13:58,463 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 80.2ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-08-21 17:13:58,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2021-08-21 17:13:58,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 4200. [2021-08-21 17:13:58,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4200 states, 4167 states have (on average 1.470842332613391) internal successors, (6129), 4199 states have internal predecessors, (6129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4200 states to 4200 states and 6129 transitions. [2021-08-21 17:13:58,532 INFO L78 Accepts]: Start accepts. Automaton has 4200 states and 6129 transitions. Word has length 60 [2021-08-21 17:13:58,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:13:58,533 INFO L470 AbstractCegarLoop]: Abstraction has 4200 states and 6129 transitions. [2021-08-21 17:13:58,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:58,533 INFO L276 IsEmpty]: Start isEmpty. Operand 4200 states and 6129 transitions. [2021-08-21 17:13:58,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-21 17:13:58,534 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:13:58,534 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:13:58,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-21 17:13:58,535 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:13:58,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:13:58,535 INFO L82 PathProgramCache]: Analyzing trace with hash 143085669, now seen corresponding path program 1 times [2021-08-21 17:13:58,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:13:58,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029958570] [2021-08-21 17:13:58,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:13:58,535 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:13:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:13:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:13:58,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:13:58,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029958570] [2021-08-21 17:13:58,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029958570] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:13:58,604 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:13:58,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:13:58,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269673151] [2021-08-21 17:13:58,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:13:58,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:13:58,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:13:58,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:13:58,606 INFO L87 Difference]: Start difference. First operand 4200 states and 6129 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:13:58,810 INFO L93 Difference]: Finished difference Result 6491 states and 9795 transitions. [2021-08-21 17:13:58,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 17:13:58,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-08-21 17:13:58,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:13:58,824 INFO L225 Difference]: With dead ends: 6491 [2021-08-21 17:13:58,824 INFO L226 Difference]: Without dead ends: 5208 [2021-08-21 17:13:58,825 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 73.7ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-08-21 17:13:58,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5208 states. [2021-08-21 17:13:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5208 to 4285. [2021-08-21 17:13:58,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4285 states, 4253 states have (on average 1.602868563367035) internal successors, (6817), 4284 states have internal predecessors, (6817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4285 states to 4285 states and 6817 transitions. [2021-08-21 17:13:58,890 INFO L78 Accepts]: Start accepts. Automaton has 4285 states and 6817 transitions. Word has length 66 [2021-08-21 17:13:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:13:58,890 INFO L470 AbstractCegarLoop]: Abstraction has 4285 states and 6817 transitions. [2021-08-21 17:13:58,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 4285 states and 6817 transitions. [2021-08-21 17:13:58,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-21 17:13:58,898 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:13:58,898 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:13:58,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-21 17:13:58,898 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:13:58,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:13:58,899 INFO L82 PathProgramCache]: Analyzing trace with hash 260345979, now seen corresponding path program 1 times [2021-08-21 17:13:58,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:13:58,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842907940] [2021-08-21 17:13:58,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:13:58,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:13:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:13:59,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:13:59,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:13:59,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842907940] [2021-08-21 17:13:59,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842907940] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:13:59,004 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:13:59,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-21 17:13:59,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925384922] [2021-08-21 17:13:59,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-21 17:13:59,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:13:59,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-21 17:13:59,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-21 17:13:59,006 INFO L87 Difference]: Start difference. First operand 4285 states and 6817 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:13:59,036 INFO L93 Difference]: Finished difference Result 641 states and 832 transitions. [2021-08-21 17:13:59,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-21 17:13:59,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2021-08-21 17:13:59,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:13:59,039 INFO L225 Difference]: With dead ends: 641 [2021-08-21 17:13:59,039 INFO L226 Difference]: Without dead ends: 641 [2021-08-21 17:13:59,039 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 22.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-21 17:13:59,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2021-08-21 17:13:59,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2021-08-21 17:13:59,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 639 states have (on average 1.302034428794992) internal successors, (832), 640 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 832 transitions. [2021-08-21 17:13:59,046 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 832 transitions. Word has length 80 [2021-08-21 17:13:59,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:13:59,047 INFO L470 AbstractCegarLoop]: Abstraction has 641 states and 832 transitions. [2021-08-21 17:13:59,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:13:59,047 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 832 transitions. [2021-08-21 17:13:59,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-08-21 17:13:59,049 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:13:59,049 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:13:59,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-21 17:13:59,049 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:13:59,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:13:59,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1506693168, now seen corresponding path program 1 times [2021-08-21 17:13:59,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:13:59,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565785209] [2021-08-21 17:13:59,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:13:59,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:13:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:13:59,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:13:59,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:13:59,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565785209] [2021-08-21 17:13:59,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565785209] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:13:59,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:13:59,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-21 17:13:59,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003436285] [2021-08-21 17:13:59,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-21 17:13:59,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:13:59,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-21 17:13:59,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-08-21 17:13:59,870 INFO L87 Difference]: Start difference. First operand 641 states and 832 transitions. Second operand has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:01,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:01,086 INFO L93 Difference]: Finished difference Result 742 states and 972 transitions. [2021-08-21 17:14:01,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-21 17:14:01,087 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2021-08-21 17:14:01,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:01,089 INFO L225 Difference]: With dead ends: 742 [2021-08-21 17:14:01,089 INFO L226 Difference]: Without dead ends: 742 [2021-08-21 17:14:01,090 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1090.6ms TimeCoverageRelationStatistics Valid=316, Invalid=944, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 17:14:01,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2021-08-21 17:14:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 734. [2021-08-21 17:14:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 732 states have (on average 1.3183060109289617) internal successors, (965), 733 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:01,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 965 transitions. [2021-08-21 17:14:01,100 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 965 transitions. Word has length 114 [2021-08-21 17:14:01,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:01,101 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 965 transitions. [2021-08-21 17:14:01,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:01,101 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 965 transitions. [2021-08-21 17:14:01,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-08-21 17:14:01,103 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:01,103 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:01,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-21 17:14:01,103 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:01,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:01,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1543026700, now seen corresponding path program 2 times [2021-08-21 17:14:01,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:01,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439022323] [2021-08-21 17:14:01,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:01,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:01,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:01,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439022323] [2021-08-21 17:14:01,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439022323] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:01,771 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:01,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-21 17:14:01,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044022481] [2021-08-21 17:14:01,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-21 17:14:01,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:01,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-21 17:14:01,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-08-21 17:14:01,772 INFO L87 Difference]: Start difference. First operand 734 states and 965 transitions. Second operand has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:03,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:03,054 INFO L93 Difference]: Finished difference Result 836 states and 1128 transitions. [2021-08-21 17:14:03,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-21 17:14:03,054 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2021-08-21 17:14:03,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:03,056 INFO L225 Difference]: With dead ends: 836 [2021-08-21 17:14:03,056 INFO L226 Difference]: Without dead ends: 836 [2021-08-21 17:14:03,057 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1320.8ms TimeCoverageRelationStatistics Valid=300, Invalid=756, Unknown=0, NotChecked=0, Total=1056 [2021-08-21 17:14:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2021-08-21 17:14:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 800. [2021-08-21 17:14:03,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 798 states have (on average 1.344611528822055) internal successors, (1073), 799 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1073 transitions. [2021-08-21 17:14:03,065 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1073 transitions. Word has length 114 [2021-08-21 17:14:03,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:03,066 INFO L470 AbstractCegarLoop]: Abstraction has 800 states and 1073 transitions. [2021-08-21 17:14:03,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1073 transitions. [2021-08-21 17:14:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-08-21 17:14:03,067 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:03,067 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:03,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-21 17:14:03,067 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:03,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:03,068 INFO L82 PathProgramCache]: Analyzing trace with hash 958122740, now seen corresponding path program 3 times [2021-08-21 17:14:03,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:03,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019182698] [2021-08-21 17:14:03,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:03,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:03,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:03,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019182698] [2021-08-21 17:14:03,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019182698] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:03,781 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:03,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-08-21 17:14:03,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577453143] [2021-08-21 17:14:03,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-21 17:14:03,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:03,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-21 17:14:03,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2021-08-21 17:14:03,782 INFO L87 Difference]: Start difference. First operand 800 states and 1073 transitions. Second operand has 22 states, 22 states have (on average 5.181818181818182) internal successors, (114), 22 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:05,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:05,454 INFO L93 Difference]: Finished difference Result 954 states and 1288 transitions. [2021-08-21 17:14:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-21 17:14:05,455 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.181818181818182) internal successors, (114), 22 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2021-08-21 17:14:05,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:05,458 INFO L225 Difference]: With dead ends: 954 [2021-08-21 17:14:05,458 INFO L226 Difference]: Without dead ends: 954 [2021-08-21 17:14:05,458 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1568.1ms TimeCoverageRelationStatistics Valid=393, Invalid=1329, Unknown=0, NotChecked=0, Total=1722 [2021-08-21 17:14:05,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2021-08-21 17:14:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 759. [2021-08-21 17:14:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 757 states have (on average 1.3262879788639366) internal successors, (1004), 758 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1004 transitions. [2021-08-21 17:14:05,468 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1004 transitions. Word has length 114 [2021-08-21 17:14:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:05,468 INFO L470 AbstractCegarLoop]: Abstraction has 759 states and 1004 transitions. [2021-08-21 17:14:05,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.181818181818182) internal successors, (114), 22 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1004 transitions. [2021-08-21 17:14:05,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-08-21 17:14:05,470 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:05,470 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:05,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-21 17:14:05,470 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:05,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:05,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1604233528, now seen corresponding path program 4 times [2021-08-21 17:14:05,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:05,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61163228] [2021-08-21 17:14:05,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:05,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:05,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:05,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61163228] [2021-08-21 17:14:05,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61163228] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:05,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:05,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-21 17:14:05,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87813720] [2021-08-21 17:14:05,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-21 17:14:05,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:05,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-21 17:14:05,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-08-21 17:14:05,965 INFO L87 Difference]: Start difference. First operand 759 states and 1004 transitions. Second operand has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:07,330 INFO L93 Difference]: Finished difference Result 908 states and 1211 transitions. [2021-08-21 17:14:07,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-21 17:14:07,330 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2021-08-21 17:14:07,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:07,333 INFO L225 Difference]: With dead ends: 908 [2021-08-21 17:14:07,333 INFO L226 Difference]: Without dead ends: 908 [2021-08-21 17:14:07,333 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1322.2ms TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2021-08-21 17:14:07,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2021-08-21 17:14:07,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 754. [2021-08-21 17:14:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 752 states have (on average 1.324468085106383) internal successors, (996), 753 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 996 transitions. [2021-08-21 17:14:07,341 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 996 transitions. Word has length 114 [2021-08-21 17:14:07,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:07,342 INFO L470 AbstractCegarLoop]: Abstraction has 754 states and 996 transitions. [2021-08-21 17:14:07,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:07,342 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 996 transitions. [2021-08-21 17:14:07,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-08-21 17:14:07,343 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:07,343 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:07,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-21 17:14:07,343 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:07,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:07,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1484236726, now seen corresponding path program 5 times [2021-08-21 17:14:07,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:07,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003002817] [2021-08-21 17:14:07,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:07,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:07,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:07,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003002817] [2021-08-21 17:14:07,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003002817] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:07,801 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:07,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-21 17:14:07,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455716807] [2021-08-21 17:14:07,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-21 17:14:07,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:07,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-21 17:14:07,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-08-21 17:14:07,802 INFO L87 Difference]: Start difference. First operand 754 states and 996 transitions. Second operand has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:09,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:09,072 INFO L93 Difference]: Finished difference Result 893 states and 1187 transitions. [2021-08-21 17:14:09,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-21 17:14:09,072 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2021-08-21 17:14:09,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:09,074 INFO L225 Difference]: With dead ends: 893 [2021-08-21 17:14:09,075 INFO L226 Difference]: Without dead ends: 893 [2021-08-21 17:14:09,075 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1209.7ms TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2021-08-21 17:14:09,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2021-08-21 17:14:09,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 744. [2021-08-21 17:14:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 742 states have (on average 1.320754716981132) internal successors, (980), 743 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 980 transitions. [2021-08-21 17:14:09,083 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 980 transitions. Word has length 114 [2021-08-21 17:14:09,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:09,083 INFO L470 AbstractCegarLoop]: Abstraction has 744 states and 980 transitions. [2021-08-21 17:14:09,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:09,084 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 980 transitions. [2021-08-21 17:14:09,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-08-21 17:14:09,085 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:09,085 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:09,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-21 17:14:09,085 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:09,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:09,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1987327336, now seen corresponding path program 6 times [2021-08-21 17:14:09,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:09,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089418926] [2021-08-21 17:14:09,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:09,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:09,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:09,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089418926] [2021-08-21 17:14:09,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089418926] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:09,563 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:09,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-21 17:14:09,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705122314] [2021-08-21 17:14:09,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-21 17:14:09,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:09,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-21 17:14:09,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-08-21 17:14:09,566 INFO L87 Difference]: Start difference. First operand 744 states and 980 transitions. Second operand has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:11,006 INFO L93 Difference]: Finished difference Result 878 states and 1163 transitions. [2021-08-21 17:14:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-21 17:14:11,007 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2021-08-21 17:14:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:11,015 INFO L225 Difference]: With dead ends: 878 [2021-08-21 17:14:11,015 INFO L226 Difference]: Without dead ends: 878 [2021-08-21 17:14:11,016 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1320.8ms TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2021-08-21 17:14:11,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2021-08-21 17:14:11,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 739. [2021-08-21 17:14:11,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 737 states have (on average 1.3188602442333786) internal successors, (972), 738 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 972 transitions. [2021-08-21 17:14:11,024 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 972 transitions. Word has length 114 [2021-08-21 17:14:11,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:11,025 INFO L470 AbstractCegarLoop]: Abstraction has 739 states and 972 transitions. [2021-08-21 17:14:11,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:11,025 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 972 transitions. [2021-08-21 17:14:11,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-08-21 17:14:11,027 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:11,027 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:11,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-21 17:14:11,027 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:11,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:11,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1617835148, now seen corresponding path program 7 times [2021-08-21 17:14:11,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:11,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899460906] [2021-08-21 17:14:11,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:11,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:11,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:11,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899460906] [2021-08-21 17:14:11,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899460906] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:11,505 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:11,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-21 17:14:11,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266467089] [2021-08-21 17:14:11,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-21 17:14:11,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:11,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-21 17:14:11,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-08-21 17:14:11,507 INFO L87 Difference]: Start difference. First operand 739 states and 972 transitions. Second operand has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:12,969 INFO L93 Difference]: Finished difference Result 911 states and 1208 transitions. [2021-08-21 17:14:12,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-21 17:14:12,969 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2021-08-21 17:14:12,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:12,971 INFO L225 Difference]: With dead ends: 911 [2021-08-21 17:14:12,971 INFO L226 Difference]: Without dead ends: 911 [2021-08-21 17:14:12,972 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1382.3ms TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2021-08-21 17:14:12,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2021-08-21 17:14:12,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 734. [2021-08-21 17:14:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 732 states have (on average 1.3128415300546448) internal successors, (961), 733 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:12,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 961 transitions. [2021-08-21 17:14:12,979 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 961 transitions. Word has length 114 [2021-08-21 17:14:12,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:12,980 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 961 transitions. [2021-08-21 17:14:12,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:12,980 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 961 transitions. [2021-08-21 17:14:12,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-08-21 17:14:12,981 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:12,981 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:12,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-21 17:14:12,981 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:12,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:12,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1469770118, now seen corresponding path program 8 times [2021-08-21 17:14:12,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:12,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192640309] [2021-08-21 17:14:12,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:12,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:13,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:13,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:13,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192640309] [2021-08-21 17:14:13,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192640309] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:13,490 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:13,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-21 17:14:13,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686928094] [2021-08-21 17:14:13,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-21 17:14:13,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:13,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-21 17:14:13,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-08-21 17:14:13,491 INFO L87 Difference]: Start difference. First operand 734 states and 961 transitions. Second operand has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:14,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:14,895 INFO L93 Difference]: Finished difference Result 604 states and 738 transitions. [2021-08-21 17:14:14,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-21 17:14:14,895 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2021-08-21 17:14:14,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:14,896 INFO L225 Difference]: With dead ends: 604 [2021-08-21 17:14:14,896 INFO L226 Difference]: Without dead ends: 544 [2021-08-21 17:14:14,897 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1367.7ms TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2021-08-21 17:14:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-08-21 17:14:14,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2021-08-21 17:14:14,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 542 states have (on average 1.2509225092250922) internal successors, (678), 543 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:14,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 678 transitions. [2021-08-21 17:14:14,902 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 678 transitions. Word has length 114 [2021-08-21 17:14:14,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:14,903 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 678 transitions. [2021-08-21 17:14:14,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:14,903 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 678 transitions. [2021-08-21 17:14:14,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-08-21 17:14:14,904 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:14,904 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:14,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-21 17:14:14,904 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:14,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:14,904 INFO L82 PathProgramCache]: Analyzing trace with hash -239951874, now seen corresponding path program 9 times [2021-08-21 17:14:14,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:14,904 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305861751] [2021-08-21 17:14:14,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:14,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:15,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:15,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305861751] [2021-08-21 17:14:15,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305861751] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:15,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:15,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-21 17:14:15,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025171408] [2021-08-21 17:14:15,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-21 17:14:15,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:15,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-21 17:14:15,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-08-21 17:14:15,397 INFO L87 Difference]: Start difference. First operand 544 states and 678 transitions. Second operand has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:16,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:16,390 INFO L93 Difference]: Finished difference Result 660 states and 840 transitions. [2021-08-21 17:14:16,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-21 17:14:16,390 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2021-08-21 17:14:16,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:16,392 INFO L225 Difference]: With dead ends: 660 [2021-08-21 17:14:16,392 INFO L226 Difference]: Without dead ends: 660 [2021-08-21 17:14:16,392 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 906.1ms TimeCoverageRelationStatistics Valid=316, Invalid=944, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 17:14:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-08-21 17:14:16,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 508. [2021-08-21 17:14:16,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 1.2504930966469427) internal successors, (634), 507 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 634 transitions. [2021-08-21 17:14:16,398 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 634 transitions. Word has length 114 [2021-08-21 17:14:16,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:16,398 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 634 transitions. [2021-08-21 17:14:16,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:16,398 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 634 transitions. [2021-08-21 17:14:16,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:14:16,399 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:16,399 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:16,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-21 17:14:16,399 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:16,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:16,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1616945591, now seen corresponding path program 1 times [2021-08-21 17:14:16,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:16,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524023241] [2021-08-21 17:14:16,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:16,400 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:18,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:18,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524023241] [2021-08-21 17:14:18,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524023241] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:18,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:18,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 17:14:18,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874293241] [2021-08-21 17:14:18,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 17:14:18,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:18,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 17:14:18,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1035, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 17:14:18,118 INFO L87 Difference]: Start difference. First operand 508 states and 634 transitions. Second operand has 34 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 34 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:21,946 INFO L93 Difference]: Finished difference Result 717 states and 936 transitions. [2021-08-21 17:14:21,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-21 17:14:21,947 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 34 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:14:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:21,948 INFO L225 Difference]: With dead ends: 717 [2021-08-21 17:14:21,948 INFO L226 Difference]: Without dead ends: 608 [2021-08-21 17:14:21,949 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 3504.8ms TimeCoverageRelationStatistics Valid=693, Invalid=3597, Unknown=0, NotChecked=0, Total=4290 [2021-08-21 17:14:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-08-21 17:14:21,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 532. [2021-08-21 17:14:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 531 states have (on average 1.2617702448210923) internal successors, (670), 531 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 670 transitions. [2021-08-21 17:14:21,954 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 670 transitions. Word has length 120 [2021-08-21 17:14:21,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:21,954 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 670 transitions. [2021-08-21 17:14:21,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 34 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 670 transitions. [2021-08-21 17:14:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:14:21,956 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:21,956 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:21,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-21 17:14:21,956 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:21,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:21,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2098408991, now seen corresponding path program 2 times [2021-08-21 17:14:21,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:21,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218377615] [2021-08-21 17:14:21,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:21,957 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:23,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:23,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:23,373 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218377615] [2021-08-21 17:14:23,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218377615] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:23,373 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:23,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-08-21 17:14:23,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839162491] [2021-08-21 17:14:23,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-21 17:14:23,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:23,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-21 17:14:23,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2021-08-21 17:14:23,374 INFO L87 Difference]: Start difference. First operand 532 states and 670 transitions. Second operand has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:28,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:28,462 INFO L93 Difference]: Finished difference Result 698 states and 908 transitions. [2021-08-21 17:14:28,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-08-21 17:14:28,463 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:14:28,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:28,464 INFO L225 Difference]: With dead ends: 698 [2021-08-21 17:14:28,464 INFO L226 Difference]: Without dead ends: 599 [2021-08-21 17:14:28,465 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 4813.4ms TimeCoverageRelationStatistics Valid=859, Invalid=3833, Unknown=0, NotChecked=0, Total=4692 [2021-08-21 17:14:28,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-08-21 17:14:28,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 537. [2021-08-21 17:14:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.2667910447761195) internal successors, (679), 536 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 679 transitions. [2021-08-21 17:14:28,471 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 679 transitions. Word has length 120 [2021-08-21 17:14:28,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:28,471 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 679 transitions. [2021-08-21 17:14:28,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:28,471 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 679 transitions. [2021-08-21 17:14:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:14:28,472 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:28,472 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:28,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-21 17:14:28,473 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:28,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:28,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1234382999, now seen corresponding path program 3 times [2021-08-21 17:14:28,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:28,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742059585] [2021-08-21 17:14:28,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:28,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:29,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:29,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742059585] [2021-08-21 17:14:29,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742059585] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:29,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:29,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-08-21 17:14:29,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770038065] [2021-08-21 17:14:29,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-21 17:14:29,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:29,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-21 17:14:29,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=974, Unknown=0, NotChecked=0, Total=1056 [2021-08-21 17:14:29,815 INFO L87 Difference]: Start difference. First operand 537 states and 679 transitions. Second operand has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:34,639 INFO L93 Difference]: Finished difference Result 692 states and 900 transitions. [2021-08-21 17:14:34,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-08-21 17:14:34,639 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:14:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:34,640 INFO L225 Difference]: With dead ends: 692 [2021-08-21 17:14:34,640 INFO L226 Difference]: Without dead ends: 598 [2021-08-21 17:14:34,641 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 4687.7ms TimeCoverageRelationStatistics Valid=808, Invalid=3748, Unknown=0, NotChecked=0, Total=4556 [2021-08-21 17:14:34,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2021-08-21 17:14:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 536. [2021-08-21 17:14:34,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.2654205607476636) internal successors, (677), 535 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 677 transitions. [2021-08-21 17:14:34,647 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 677 transitions. Word has length 120 [2021-08-21 17:14:34,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:34,647 INFO L470 AbstractCegarLoop]: Abstraction has 536 states and 677 transitions. [2021-08-21 17:14:34,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:34,647 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 677 transitions. [2021-08-21 17:14:34,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:14:34,648 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:34,648 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:34,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-21 17:14:34,648 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:34,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:34,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1675014383, now seen corresponding path program 4 times [2021-08-21 17:14:34,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:34,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23087345] [2021-08-21 17:14:34,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:34,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:36,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:36,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:36,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23087345] [2021-08-21 17:14:36,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23087345] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:36,036 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:36,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-08-21 17:14:36,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768576187] [2021-08-21 17:14:36,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-21 17:14:36,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:36,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-21 17:14:36,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=974, Unknown=0, NotChecked=0, Total=1056 [2021-08-21 17:14:36,039 INFO L87 Difference]: Start difference. First operand 536 states and 677 transitions. Second operand has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:40,736 INFO L93 Difference]: Finished difference Result 693 states and 900 transitions. [2021-08-21 17:14:40,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-08-21 17:14:40,737 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:14:40,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:40,738 INFO L225 Difference]: With dead ends: 693 [2021-08-21 17:14:40,738 INFO L226 Difference]: Without dead ends: 596 [2021-08-21 17:14:40,739 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 4529.0ms TimeCoverageRelationStatistics Valid=764, Invalid=3658, Unknown=0, NotChecked=0, Total=4422 [2021-08-21 17:14:40,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-08-21 17:14:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 534. [2021-08-21 17:14:40,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.2626641651031896) internal successors, (673), 533 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:40,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 673 transitions. [2021-08-21 17:14:40,744 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 673 transitions. Word has length 120 [2021-08-21 17:14:40,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:40,745 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 673 transitions. [2021-08-21 17:14:40,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:40,745 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 673 transitions. [2021-08-21 17:14:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:14:40,746 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:40,746 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:40,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-21 17:14:40,746 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:40,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:40,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1416909901, now seen corresponding path program 5 times [2021-08-21 17:14:40,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:40,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536931343] [2021-08-21 17:14:40,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:40,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:42,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:42,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536931343] [2021-08-21 17:14:42,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536931343] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:42,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:42,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-08-21 17:14:42,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234103556] [2021-08-21 17:14:42,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-21 17:14:42,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:42,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-21 17:14:42,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=974, Unknown=0, NotChecked=0, Total=1056 [2021-08-21 17:14:42,115 INFO L87 Difference]: Start difference. First operand 534 states and 673 transitions. Second operand has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:46,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:46,628 INFO L93 Difference]: Finished difference Result 692 states and 897 transitions. [2021-08-21 17:14:46,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-21 17:14:46,629 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:14:46,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:46,630 INFO L225 Difference]: With dead ends: 692 [2021-08-21 17:14:46,630 INFO L226 Difference]: Without dead ends: 595 [2021-08-21 17:14:46,631 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 4295.5ms TimeCoverageRelationStatistics Valid=723, Invalid=3567, Unknown=0, NotChecked=0, Total=4290 [2021-08-21 17:14:46,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2021-08-21 17:14:46,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 533. [2021-08-21 17:14:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 1.2612781954887218) internal successors, (671), 532 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 671 transitions. [2021-08-21 17:14:46,636 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 671 transitions. Word has length 120 [2021-08-21 17:14:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:46,636 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 671 transitions. [2021-08-21 17:14:46,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 671 transitions. [2021-08-21 17:14:46,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:14:46,637 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:46,637 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:46,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-21 17:14:46,638 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:46,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:46,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1128104411, now seen corresponding path program 6 times [2021-08-21 17:14:46,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:46,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873778757] [2021-08-21 17:14:46,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:46,638 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:48,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:48,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:48,199 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873778757] [2021-08-21 17:14:48,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873778757] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:48,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:48,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 17:14:48,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872203133] [2021-08-21 17:14:48,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 17:14:48,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:48,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 17:14:48,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1035, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 17:14:48,200 INFO L87 Difference]: Start difference. First operand 533 states and 671 transitions. Second operand has 34 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 34 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:51,782 INFO L93 Difference]: Finished difference Result 685 states and 888 transitions. [2021-08-21 17:14:51,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-21 17:14:51,782 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 34 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:14:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:51,783 INFO L225 Difference]: With dead ends: 685 [2021-08-21 17:14:51,783 INFO L226 Difference]: Without dead ends: 575 [2021-08-21 17:14:51,784 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 3467.7ms TimeCoverageRelationStatistics Valid=705, Invalid=3585, Unknown=0, NotChecked=0, Total=4290 [2021-08-21 17:14:51,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-08-21 17:14:51,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 520. [2021-08-21 17:14:51,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 519 states have (on average 1.2447013487475915) internal successors, (646), 519 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 646 transitions. [2021-08-21 17:14:51,789 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 646 transitions. Word has length 120 [2021-08-21 17:14:51,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:51,790 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 646 transitions. [2021-08-21 17:14:51,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 34 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:51,790 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 646 transitions. [2021-08-21 17:14:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:14:51,791 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:51,791 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:51,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-21 17:14:51,791 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:51,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:51,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1693316385, now seen corresponding path program 7 times [2021-08-21 17:14:51,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:51,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601621327] [2021-08-21 17:14:51,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:51,792 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:53,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:53,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601621327] [2021-08-21 17:14:53,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601621327] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:53,271 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:53,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-08-21 17:14:53,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913356672] [2021-08-21 17:14:53,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-21 17:14:53,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:53,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-21 17:14:53,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2021-08-21 17:14:53,273 INFO L87 Difference]: Start difference. First operand 520 states and 646 transitions. Second operand has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:57,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:14:57,190 INFO L93 Difference]: Finished difference Result 683 states and 879 transitions. [2021-08-21 17:14:57,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-08-21 17:14:57,191 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:14:57,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:14:57,191 INFO L225 Difference]: With dead ends: 683 [2021-08-21 17:14:57,192 INFO L226 Difference]: Without dead ends: 583 [2021-08-21 17:14:57,192 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 3911.2ms TimeCoverageRelationStatistics Valid=826, Invalid=3730, Unknown=0, NotChecked=0, Total=4556 [2021-08-21 17:14:57,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-08-21 17:14:57,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 526. [2021-08-21 17:14:57,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.2514285714285713) internal successors, (657), 525 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:57,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 657 transitions. [2021-08-21 17:14:57,198 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 657 transitions. Word has length 120 [2021-08-21 17:14:57,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:14:57,198 INFO L470 AbstractCegarLoop]: Abstraction has 526 states and 657 transitions. [2021-08-21 17:14:57,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:14:57,198 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 657 transitions. [2021-08-21 17:14:57,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:14:57,199 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:14:57,199 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:14:57,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-21 17:14:57,199 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:14:57,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:14:57,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1338395729, now seen corresponding path program 8 times [2021-08-21 17:14:57,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:14:57,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132117669] [2021-08-21 17:14:57,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:14:57,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:14:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:14:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:14:58,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:14:58,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132117669] [2021-08-21 17:14:58,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132117669] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:14:58,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:14:58,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-08-21 17:14:58,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845574538] [2021-08-21 17:14:58,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-21 17:14:58,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:14:58,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-21 17:14:58,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2021-08-21 17:14:58,798 INFO L87 Difference]: Start difference. First operand 526 states and 657 transitions. Second operand has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:03,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:15:03,620 INFO L93 Difference]: Finished difference Result 681 states and 877 transitions. [2021-08-21 17:15:03,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-08-21 17:15:03,623 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:15:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:15:03,624 INFO L225 Difference]: With dead ends: 681 [2021-08-21 17:15:03,624 INFO L226 Difference]: Without dead ends: 582 [2021-08-21 17:15:03,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 4612.1ms TimeCoverageRelationStatistics Valid=796, Invalid=3626, Unknown=0, NotChecked=0, Total=4422 [2021-08-21 17:15:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-08-21 17:15:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 527. [2021-08-21 17:15:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.252851711026616) internal successors, (659), 526 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 659 transitions. [2021-08-21 17:15:03,630 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 659 transitions. Word has length 120 [2021-08-21 17:15:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:15:03,630 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 659 transitions. [2021-08-21 17:15:03,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:03,630 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 659 transitions. [2021-08-21 17:15:03,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:15:03,631 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:15:03,631 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:15:03,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-21 17:15:03,632 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:15:03,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:15:03,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1364003681, now seen corresponding path program 9 times [2021-08-21 17:15:03,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:15:03,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212737915] [2021-08-21 17:15:03,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:15:03,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:15:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:15:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:15:05,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:15:05,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212737915] [2021-08-21 17:15:05,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212737915] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:15:05,105 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:15:05,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-08-21 17:15:05,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861906860] [2021-08-21 17:15:05,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-21 17:15:05,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:15:05,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-21 17:15:05,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2021-08-21 17:15:05,107 INFO L87 Difference]: Start difference. First operand 527 states and 659 transitions. Second operand has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:09,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:15:09,966 INFO L93 Difference]: Finished difference Result 671 states and 863 transitions. [2021-08-21 17:15:09,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-21 17:15:09,966 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:15:09,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:15:09,968 INFO L225 Difference]: With dead ends: 671 [2021-08-21 17:15:09,968 INFO L226 Difference]: Without dead ends: 572 [2021-08-21 17:15:09,969 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 4450.0ms TimeCoverageRelationStatistics Valid=769, Invalid=3521, Unknown=0, NotChecked=0, Total=4290 [2021-08-21 17:15:09,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-08-21 17:15:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 529. [2021-08-21 17:15:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.2556818181818181) internal successors, (663), 528 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:09,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 663 transitions. [2021-08-21 17:15:09,975 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 663 transitions. Word has length 120 [2021-08-21 17:15:09,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:15:09,975 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 663 transitions. [2021-08-21 17:15:09,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:09,975 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 663 transitions. [2021-08-21 17:15:09,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:15:09,976 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:15:09,977 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:15:09,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-21 17:15:09,977 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:15:09,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:15:09,977 INFO L82 PathProgramCache]: Analyzing trace with hash -53461409, now seen corresponding path program 10 times [2021-08-21 17:15:09,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:15:09,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654772671] [2021-08-21 17:15:09,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:15:09,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:15:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:15:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:15:11,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:15:11,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654772671] [2021-08-21 17:15:11,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654772671] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:15:11,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:15:11,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-08-21 17:15:11,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637123783] [2021-08-21 17:15:11,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-21 17:15:11,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:15:11,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-21 17:15:11,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2021-08-21 17:15:11,449 INFO L87 Difference]: Start difference. First operand 529 states and 663 transitions. Second operand has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:15:15,988 INFO L93 Difference]: Finished difference Result 660 states and 847 transitions. [2021-08-21 17:15:15,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-21 17:15:15,989 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:15:15,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:15:15,990 INFO L225 Difference]: With dead ends: 660 [2021-08-21 17:15:15,990 INFO L226 Difference]: Without dead ends: 564 [2021-08-21 17:15:15,990 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 4268.1ms TimeCoverageRelationStatistics Valid=745, Invalid=3415, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:15:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2021-08-21 17:15:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 530. [2021-08-21 17:15:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 1.2570888468809074) internal successors, (665), 529 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 665 transitions. [2021-08-21 17:15:15,996 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 665 transitions. Word has length 120 [2021-08-21 17:15:15,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:15:15,997 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 665 transitions. [2021-08-21 17:15:15,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:15,997 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 665 transitions. [2021-08-21 17:15:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:15:15,998 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:15:15,998 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:15:15,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-21 17:15:15,998 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:15:15,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:15:15,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1904598993, now seen corresponding path program 11 times [2021-08-21 17:15:15,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:15:15,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386270556] [2021-08-21 17:15:15,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:15:15,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:15:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:15:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:15:17,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:15:17,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386270556] [2021-08-21 17:15:17,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386270556] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:15:17,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:15:17,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-08-21 17:15:17,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059586211] [2021-08-21 17:15:17,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-21 17:15:17,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:15:17,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-21 17:15:17,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2021-08-21 17:15:17,447 INFO L87 Difference]: Start difference. First operand 530 states and 665 transitions. Second operand has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:21,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:15:21,169 INFO L93 Difference]: Finished difference Result 650 states and 833 transitions. [2021-08-21 17:15:21,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-21 17:15:21,169 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:15:21,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:15:21,170 INFO L225 Difference]: With dead ends: 650 [2021-08-21 17:15:21,170 INFO L226 Difference]: Without dead ends: 554 [2021-08-21 17:15:21,171 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 3629.6ms TimeCoverageRelationStatistics Valid=707, Invalid=3199, Unknown=0, NotChecked=0, Total=3906 [2021-08-21 17:15:21,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2021-08-21 17:15:21,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 530. [2021-08-21 17:15:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 1.2551984877126654) internal successors, (664), 529 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 664 transitions. [2021-08-21 17:15:21,179 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 664 transitions. Word has length 120 [2021-08-21 17:15:21,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:15:21,180 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 664 transitions. [2021-08-21 17:15:21,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:21,180 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 664 transitions. [2021-08-21 17:15:21,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:15:21,181 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:15:21,181 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:15:21,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-21 17:15:21,181 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:15:21,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:15:21,181 INFO L82 PathProgramCache]: Analyzing trace with hash -897133333, now seen corresponding path program 12 times [2021-08-21 17:15:21,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:15:21,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361322250] [2021-08-21 17:15:21,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:15:21,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:15:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:15:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:15:23,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:15:23,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361322250] [2021-08-21 17:15:23,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361322250] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:15:23,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:15:23,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-08-21 17:15:23,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808817627] [2021-08-21 17:15:23,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-08-21 17:15:23,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:15:23,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-08-21 17:15:23,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1293, Unknown=0, NotChecked=0, Total=1406 [2021-08-21 17:15:23,232 INFO L87 Difference]: Start difference. First operand 530 states and 664 transitions. Second operand has 38 states, 38 states have (on average 3.1578947368421053) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:15:27,909 INFO L93 Difference]: Finished difference Result 648 states and 829 transitions. [2021-08-21 17:15:27,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-08-21 17:15:27,909 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.1578947368421053) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:15:27,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:15:27,910 INFO L225 Difference]: With dead ends: 648 [2021-08-21 17:15:27,910 INFO L226 Difference]: Without dead ends: 553 [2021-08-21 17:15:27,911 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 4683.4ms TimeCoverageRelationStatistics Valid=865, Invalid=4537, Unknown=0, NotChecked=0, Total=5402 [2021-08-21 17:15:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2021-08-21 17:15:27,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 529. [2021-08-21 17:15:27,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.253787878787879) internal successors, (662), 528 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 662 transitions. [2021-08-21 17:15:27,916 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 662 transitions. Word has length 120 [2021-08-21 17:15:27,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:15:27,916 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 662 transitions. [2021-08-21 17:15:27,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.1578947368421053) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:27,917 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 662 transitions. [2021-08-21 17:15:27,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:15:27,918 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:15:27,918 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:15:27,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-21 17:15:27,918 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:15:27,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:15:27,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1020189327, now seen corresponding path program 13 times [2021-08-21 17:15:27,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:15:27,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072332986] [2021-08-21 17:15:27,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:15:27,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:15:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:15:30,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:15:30,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:15:30,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072332986] [2021-08-21 17:15:30,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072332986] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:15:30,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:15:30,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-08-21 17:15:30,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19696109] [2021-08-21 17:15:30,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-08-21 17:15:30,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:15:30,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-08-21 17:15:30,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1293, Unknown=0, NotChecked=0, Total=1406 [2021-08-21 17:15:30,053 INFO L87 Difference]: Start difference. First operand 529 states and 662 transitions. Second operand has 38 states, 38 states have (on average 3.1578947368421053) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:15:34,702 INFO L93 Difference]: Finished difference Result 654 states and 837 transitions. [2021-08-21 17:15:34,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-08-21 17:15:34,703 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.1578947368421053) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:15:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:15:34,704 INFO L225 Difference]: With dead ends: 654 [2021-08-21 17:15:34,704 INFO L226 Difference]: Without dead ends: 560 [2021-08-21 17:15:34,704 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 4651.7ms TimeCoverageRelationStatistics Valid=906, Invalid=4794, Unknown=0, NotChecked=0, Total=5700 [2021-08-21 17:15:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2021-08-21 17:15:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 531. [2021-08-21 17:15:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.2547169811320755) internal successors, (665), 530 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 665 transitions. [2021-08-21 17:15:34,709 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 665 transitions. Word has length 120 [2021-08-21 17:15:34,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:15:34,709 INFO L470 AbstractCegarLoop]: Abstraction has 531 states and 665 transitions. [2021-08-21 17:15:34,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.1578947368421053) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 665 transitions. [2021-08-21 17:15:34,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:15:34,710 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:15:34,710 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:15:34,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-21 17:15:34,711 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:15:34,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:15:34,711 INFO L82 PathProgramCache]: Analyzing trace with hash -579557943, now seen corresponding path program 14 times [2021-08-21 17:15:34,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:15:34,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651834058] [2021-08-21 17:15:34,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:15:34,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:15:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:15:36,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:15:36,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:15:36,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651834058] [2021-08-21 17:15:36,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651834058] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:15:36,359 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:15:36,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-21 17:15:36,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063070911] [2021-08-21 17:15:36,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-21 17:15:36,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:15:36,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-21 17:15:36,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1163, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 17:15:36,360 INFO L87 Difference]: Start difference. First operand 531 states and 665 transitions. Second operand has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:40,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:15:40,771 INFO L93 Difference]: Finished difference Result 650 states and 831 transitions. [2021-08-21 17:15:40,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-08-21 17:15:40,771 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:15:40,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:15:40,772 INFO L225 Difference]: With dead ends: 650 [2021-08-21 17:15:40,772 INFO L226 Difference]: Without dead ends: 551 [2021-08-21 17:15:40,773 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 4323.1ms TimeCoverageRelationStatistics Valid=863, Invalid=4249, Unknown=0, NotChecked=0, Total=5112 [2021-08-21 17:15:40,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2021-08-21 17:15:40,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 527. [2021-08-21 17:15:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.2509505703422052) internal successors, (658), 526 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:40,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 658 transitions. [2021-08-21 17:15:40,779 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 658 transitions. Word has length 120 [2021-08-21 17:15:40,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:15:40,780 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 658 transitions. [2021-08-21 17:15:40,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 658 transitions. [2021-08-21 17:15:40,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:15:40,786 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:15:40,786 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:15:40,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-21 17:15:40,786 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:15:40,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:15:40,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1918457325, now seen corresponding path program 15 times [2021-08-21 17:15:40,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:15:40,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159652731] [2021-08-21 17:15:40,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:15:40,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:15:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:15:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:15:43,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:15:43,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159652731] [2021-08-21 17:15:43,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159652731] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:15:43,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:15:43,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-08-21 17:15:43,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690315996] [2021-08-21 17:15:43,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-08-21 17:15:43,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:15:43,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-08-21 17:15:43,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1293, Unknown=0, NotChecked=0, Total=1406 [2021-08-21 17:15:43,111 INFO L87 Difference]: Start difference. First operand 527 states and 658 transitions. Second operand has 38 states, 38 states have (on average 3.1578947368421053) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:48,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:15:48,348 INFO L93 Difference]: Finished difference Result 654 states and 836 transitions. [2021-08-21 17:15:48,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-08-21 17:15:48,349 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.1578947368421053) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:15:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:15:48,350 INFO L225 Difference]: With dead ends: 654 [2021-08-21 17:15:48,350 INFO L226 Difference]: Without dead ends: 560 [2021-08-21 17:15:48,350 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 5274.8ms TimeCoverageRelationStatistics Valid=932, Invalid=4920, Unknown=0, NotChecked=0, Total=5852 [2021-08-21 17:15:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2021-08-21 17:15:48,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 530. [2021-08-21 17:15:48,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 1.2533081285444234) internal successors, (663), 529 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 663 transitions. [2021-08-21 17:15:48,355 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 663 transitions. Word has length 120 [2021-08-21 17:15:48,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:15:48,356 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 663 transitions. [2021-08-21 17:15:48,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.1578947368421053) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 663 transitions. [2021-08-21 17:15:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:15:48,357 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:15:48,357 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:15:48,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-21 17:15:48,357 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:15:48,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:15:48,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1477825941, now seen corresponding path program 16 times [2021-08-21 17:15:48,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:15:48,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590451633] [2021-08-21 17:15:48,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:15:48,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:15:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:15:49,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:15:49,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:15:49,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590451633] [2021-08-21 17:15:49,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590451633] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:15:49,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:15:49,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-21 17:15:49,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069812324] [2021-08-21 17:15:49,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-21 17:15:49,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:15:49,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-21 17:15:49,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1163, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 17:15:49,978 INFO L87 Difference]: Start difference. First operand 530 states and 663 transitions. Second operand has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:53,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:15:53,700 INFO L93 Difference]: Finished difference Result 655 states and 836 transitions. [2021-08-21 17:15:53,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-08-21 17:15:53,700 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:15:53,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:15:53,701 INFO L225 Difference]: With dead ends: 655 [2021-08-21 17:15:53,701 INFO L226 Difference]: Without dead ends: 558 [2021-08-21 17:15:53,702 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 3766.9ms TimeCoverageRelationStatistics Valid=911, Invalid=4491, Unknown=0, NotChecked=0, Total=5402 [2021-08-21 17:15:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-08-21 17:15:53,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 528. [2021-08-21 17:15:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.2504743833017078) internal successors, (659), 527 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 659 transitions. [2021-08-21 17:15:53,706 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 659 transitions. Word has length 120 [2021-08-21 17:15:53,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:15:53,706 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 659 transitions. [2021-08-21 17:15:53,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 659 transitions. [2021-08-21 17:15:53,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:15:53,708 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:15:53,708 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:15:53,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-21 17:15:53,714 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:15:53,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:15:53,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1735930423, now seen corresponding path program 17 times [2021-08-21 17:15:53,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:15:53,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511001840] [2021-08-21 17:15:53,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:15:53,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:15:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:15:55,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:15:55,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:15:55,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511001840] [2021-08-21 17:15:55,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511001840] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:15:55,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:15:55,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-21 17:15:55,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722660516] [2021-08-21 17:15:55,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-21 17:15:55,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:15:55,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-21 17:15:55,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1163, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 17:15:55,088 INFO L87 Difference]: Start difference. First operand 528 states and 659 transitions. Second operand has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:58,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:15:58,746 INFO L93 Difference]: Finished difference Result 648 states and 826 transitions. [2021-08-21 17:15:58,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-08-21 17:15:58,746 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:15:58,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:15:58,747 INFO L225 Difference]: With dead ends: 648 [2021-08-21 17:15:58,747 INFO L226 Difference]: Without dead ends: 550 [2021-08-21 17:15:58,748 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 3529.0ms TimeCoverageRelationStatistics Valid=845, Invalid=4267, Unknown=0, NotChecked=0, Total=5112 [2021-08-21 17:15:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-08-21 17:15:58,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 526. [2021-08-21 17:15:58,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.2495238095238095) internal successors, (656), 525 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:58,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 656 transitions. [2021-08-21 17:15:58,752 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 656 transitions. Word has length 120 [2021-08-21 17:15:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:15:58,752 INFO L470 AbstractCegarLoop]: Abstraction has 526 states and 656 transitions. [2021-08-21 17:15:58,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:15:58,753 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 656 transitions. [2021-08-21 17:15:58,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:15:58,753 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:15:58,754 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:15:58,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-21 17:15:58,754 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:15:58,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:15:58,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1705495641, now seen corresponding path program 18 times [2021-08-21 17:15:58,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:15:58,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75844694] [2021-08-21 17:15:58,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:15:58,754 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:15:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:16:00,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:16:00,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:16:00,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75844694] [2021-08-21 17:16:00,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75844694] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:16:00,756 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:16:00,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-08-21 17:16:00,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579254534] [2021-08-21 17:16:00,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-08-21 17:16:00,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:16:00,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-08-21 17:16:00,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1293, Unknown=0, NotChecked=0, Total=1406 [2021-08-21 17:16:00,757 INFO L87 Difference]: Start difference. First operand 526 states and 656 transitions. Second operand has 38 states, 38 states have (on average 3.1578947368421053) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:05,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:16:05,588 INFO L93 Difference]: Finished difference Result 650 states and 828 transitions. [2021-08-21 17:16:05,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-08-21 17:16:05,588 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.1578947368421053) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:16:05,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:16:05,589 INFO L225 Difference]: With dead ends: 650 [2021-08-21 17:16:05,589 INFO L226 Difference]: Without dead ends: 556 [2021-08-21 17:16:05,590 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 4944.3ms TimeCoverageRelationStatistics Valid=961, Invalid=5045, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 17:16:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-08-21 17:16:05,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 525. [2021-08-21 17:16:05,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 524 states have (on average 1.248091603053435) internal successors, (654), 524 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:05,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 654 transitions. [2021-08-21 17:16:05,594 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 654 transitions. Word has length 120 [2021-08-21 17:16:05,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:16:05,594 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 654 transitions. [2021-08-21 17:16:05,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.1578947368421053) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 654 transitions. [2021-08-21 17:16:05,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:16:05,595 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:16:05,595 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:16:05,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-21 17:16:05,595 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:16:05,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:16:05,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1264864257, now seen corresponding path program 19 times [2021-08-21 17:16:05,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:16:05,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86659805] [2021-08-21 17:16:05,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:16:05,596 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:16:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:16:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:16:07,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:16:07,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86659805] [2021-08-21 17:16:07,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86659805] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:16:07,413 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:16:07,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-21 17:16:07,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864770464] [2021-08-21 17:16:07,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-21 17:16:07,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:16:07,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-21 17:16:07,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1163, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 17:16:07,414 INFO L87 Difference]: Start difference. First operand 525 states and 654 transitions. Second operand has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:16:12,356 INFO L93 Difference]: Finished difference Result 651 states and 828 transitions. [2021-08-21 17:16:12,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-08-21 17:16:12,357 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:16:12,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:16:12,357 INFO L225 Difference]: With dead ends: 651 [2021-08-21 17:16:12,358 INFO L226 Difference]: Without dead ends: 554 [2021-08-21 17:16:12,358 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 5096.7ms TimeCoverageRelationStatistics Valid=941, Invalid=4609, Unknown=0, NotChecked=0, Total=5550 [2021-08-21 17:16:12,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2021-08-21 17:16:12,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 523. [2021-08-21 17:16:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.2452107279693487) internal successors, (650), 522 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 650 transitions. [2021-08-21 17:16:12,362 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 650 transitions. Word has length 120 [2021-08-21 17:16:12,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:16:12,362 INFO L470 AbstractCegarLoop]: Abstraction has 523 states and 650 transitions. [2021-08-21 17:16:12,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:12,363 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 650 transitions. [2021-08-21 17:16:12,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:16:12,363 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:16:12,363 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:16:12,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-21 17:16:12,364 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:16:12,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:16:12,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1522968739, now seen corresponding path program 20 times [2021-08-21 17:16:12,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:16:12,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114648788] [2021-08-21 17:16:12,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:16:12,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:16:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:16:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:16:13,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:16:13,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114648788] [2021-08-21 17:16:13,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114648788] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:16:13,993 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:16:13,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-21 17:16:13,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405200731] [2021-08-21 17:16:13,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-21 17:16:13,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:16:13,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-21 17:16:13,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1163, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 17:16:13,994 INFO L87 Difference]: Start difference. First operand 523 states and 650 transitions. Second operand has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:16:18,435 INFO L93 Difference]: Finished difference Result 650 states and 825 transitions. [2021-08-21 17:16:18,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-08-21 17:16:18,436 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:16:18,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:16:18,437 INFO L225 Difference]: With dead ends: 650 [2021-08-21 17:16:18,440 INFO L226 Difference]: Without dead ends: 553 [2021-08-21 17:16:18,441 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 4407.2ms TimeCoverageRelationStatistics Valid=896, Invalid=4506, Unknown=0, NotChecked=0, Total=5402 [2021-08-21 17:16:18,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2021-08-21 17:16:18,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 522. [2021-08-21 17:16:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 1.2437619961612285) internal successors, (648), 521 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 648 transitions. [2021-08-21 17:16:18,450 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 648 transitions. Word has length 120 [2021-08-21 17:16:18,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:16:18,450 INFO L470 AbstractCegarLoop]: Abstraction has 522 states and 648 transitions. [2021-08-21 17:16:18,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:18,451 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 648 transitions. [2021-08-21 17:16:18,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:16:18,451 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:16:18,452 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:16:18,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-21 17:16:18,453 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:16:18,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:16:18,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1811774229, now seen corresponding path program 21 times [2021-08-21 17:16:18,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:16:18,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704911207] [2021-08-21 17:16:18,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:16:18,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:16:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:16:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:16:20,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:16:20,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704911207] [2021-08-21 17:16:20,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704911207] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:16:20,173 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:16:20,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-08-21 17:16:20,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518569880] [2021-08-21 17:16:20,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-21 17:16:20,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:16:20,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-21 17:16:20,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1035, Unknown=0, NotChecked=0, Total=1122 [2021-08-21 17:16:20,189 INFO L87 Difference]: Start difference. First operand 522 states and 648 transitions. Second operand has 34 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 34 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:24,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:16:24,064 INFO L93 Difference]: Finished difference Result 643 states and 816 transitions. [2021-08-21 17:16:24,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-21 17:16:24,066 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 34 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:16:24,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:16:24,067 INFO L225 Difference]: With dead ends: 643 [2021-08-21 17:16:24,067 INFO L226 Difference]: Without dead ends: 532 [2021-08-21 17:16:24,067 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 3730.8ms TimeCoverageRelationStatistics Valid=677, Invalid=3483, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:16:24,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-08-21 17:16:24,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 508. [2021-08-21 17:16:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 1.2485207100591715) internal successors, (633), 507 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 633 transitions. [2021-08-21 17:16:24,077 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 633 transitions. Word has length 120 [2021-08-21 17:16:24,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:16:24,077 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 633 transitions. [2021-08-21 17:16:24,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 34 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:24,079 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 633 transitions. [2021-08-21 17:16:24,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:16:24,080 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:16:24,080 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:16:24,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-21 17:16:24,080 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:16:24,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:16:24,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1340312343, now seen corresponding path program 22 times [2021-08-21 17:16:24,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:16:24,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909737629] [2021-08-21 17:16:24,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:16:24,081 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:16:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:16:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:16:25,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:16:25,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909737629] [2021-08-21 17:16:25,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909737629] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:16:25,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:16:25,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-21 17:16:25,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056943413] [2021-08-21 17:16:25,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-21 17:16:25,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:16:25,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-21 17:16:25,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1163, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 17:16:25,654 INFO L87 Difference]: Start difference. First operand 508 states and 633 transitions. Second operand has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:16:30,268 INFO L93 Difference]: Finished difference Result 688 states and 866 transitions. [2021-08-21 17:16:30,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-08-21 17:16:30,268 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:16:30,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:16:30,269 INFO L225 Difference]: With dead ends: 688 [2021-08-21 17:16:30,269 INFO L226 Difference]: Without dead ends: 579 [2021-08-21 17:16:30,270 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 4493.0ms TimeCoverageRelationStatistics Valid=903, Invalid=4647, Unknown=0, NotChecked=0, Total=5550 [2021-08-21 17:16:30,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2021-08-21 17:16:30,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 520. [2021-08-21 17:16:30,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 519 states have (on average 1.2427745664739884) internal successors, (645), 519 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 645 transitions. [2021-08-21 17:16:30,276 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 645 transitions. Word has length 120 [2021-08-21 17:16:30,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:16:30,276 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 645 transitions. [2021-08-21 17:16:30,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 645 transitions. [2021-08-21 17:16:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:16:30,277 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:16:30,277 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:16:30,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-21 17:16:30,278 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:16:30,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:16:30,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1919925057, now seen corresponding path program 23 times [2021-08-21 17:16:30,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:16:30,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356690848] [2021-08-21 17:16:30,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:16:30,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:16:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:16:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:16:31,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:16:31,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356690848] [2021-08-21 17:16:31,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356690848] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:16:31,638 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:16:31,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-08-21 17:16:31,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365749253] [2021-08-21 17:16:31,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-21 17:16:31,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:16:31,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-21 17:16:31,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2021-08-21 17:16:31,639 INFO L87 Difference]: Start difference. First operand 520 states and 645 transitions. Second operand has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:35,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:16:35,831 INFO L93 Difference]: Finished difference Result 643 states and 804 transitions. [2021-08-21 17:16:35,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-08-21 17:16:35,831 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:16:35,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:16:35,832 INFO L225 Difference]: With dead ends: 643 [2021-08-21 17:16:35,832 INFO L226 Difference]: Without dead ends: 544 [2021-08-21 17:16:35,833 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 4058.9ms TimeCoverageRelationStatistics Valid=895, Invalid=3935, Unknown=0, NotChecked=0, Total=4830 [2021-08-21 17:16:35,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-08-21 17:16:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 525. [2021-08-21 17:16:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 524 states have (on average 1.248091603053435) internal successors, (654), 524 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 654 transitions. [2021-08-21 17:16:35,837 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 654 transitions. Word has length 120 [2021-08-21 17:16:35,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:16:35,837 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 654 transitions. [2021-08-21 17:16:35,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:35,837 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 654 transitions. [2021-08-21 17:16:35,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:16:35,838 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:16:35,838 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:16:35,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-21 17:16:35,838 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:16:35,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:16:35,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1511016247, now seen corresponding path program 24 times [2021-08-21 17:16:35,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:16:35,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038144964] [2021-08-21 17:16:35,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:16:35,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:16:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:16:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:16:37,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:16:37,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038144964] [2021-08-21 17:16:37,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038144964] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:16:37,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:16:37,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-21 17:16:37,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519657903] [2021-08-21 17:16:37,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-21 17:16:37,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:16:37,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-21 17:16:37,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1163, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 17:16:37,475 INFO L87 Difference]: Start difference. First operand 525 states and 654 transitions. Second operand has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:42,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:16:42,485 INFO L93 Difference]: Finished difference Result 637 states and 796 transitions. [2021-08-21 17:16:42,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-21 17:16:42,485 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:16:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:16:42,486 INFO L225 Difference]: With dead ends: 637 [2021-08-21 17:16:42,486 INFO L226 Difference]: Without dead ends: 543 [2021-08-21 17:16:42,487 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 5114.8ms TimeCoverageRelationStatistics Valid=1060, Invalid=4946, Unknown=0, NotChecked=0, Total=6006 [2021-08-21 17:16:42,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-08-21 17:16:42,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 524. [2021-08-21 17:16:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 1.2466539196940727) internal successors, (652), 523 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 652 transitions. [2021-08-21 17:16:42,491 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 652 transitions. Word has length 120 [2021-08-21 17:16:42,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:16:42,491 INFO L470 AbstractCegarLoop]: Abstraction has 524 states and 652 transitions. [2021-08-21 17:16:42,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 652 transitions. [2021-08-21 17:16:42,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:16:42,492 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:16:42,492 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:16:42,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-21 17:16:42,493 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:16:42,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:16:42,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1951647631, now seen corresponding path program 25 times [2021-08-21 17:16:42,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:16:42,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751445084] [2021-08-21 17:16:42,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:16:42,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:16:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:16:43,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:16:43,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:16:43,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751445084] [2021-08-21 17:16:43,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751445084] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:16:43,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:16:43,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-08-21 17:16:43,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480476046] [2021-08-21 17:16:43,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-21 17:16:43,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:16:43,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-21 17:16:43,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=974, Unknown=0, NotChecked=0, Total=1056 [2021-08-21 17:16:43,854 INFO L87 Difference]: Start difference. First operand 524 states and 652 transitions. Second operand has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:48,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:16:48,649 INFO L93 Difference]: Finished difference Result 638 states and 796 transitions. [2021-08-21 17:16:48,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-08-21 17:16:48,650 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:16:48,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:16:48,651 INFO L225 Difference]: With dead ends: 638 [2021-08-21 17:16:48,651 INFO L226 Difference]: Without dead ends: 541 [2021-08-21 17:16:48,651 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 4641.8ms TimeCoverageRelationStatistics Valid=798, Invalid=3758, Unknown=0, NotChecked=0, Total=4556 [2021-08-21 17:16:48,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2021-08-21 17:16:48,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 522. [2021-08-21 17:16:48,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 1.2437619961612285) internal successors, (648), 521 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:48,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 648 transitions. [2021-08-21 17:16:48,656 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 648 transitions. Word has length 120 [2021-08-21 17:16:48,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:16:48,656 INFO L470 AbstractCegarLoop]: Abstraction has 522 states and 648 transitions. [2021-08-21 17:16:48,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 648 transitions. [2021-08-21 17:16:48,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:16:48,667 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:16:48,667 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:16:48,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-21 17:16:48,667 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:16:48,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:16:48,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1693543149, now seen corresponding path program 26 times [2021-08-21 17:16:48,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:16:48,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242741157] [2021-08-21 17:16:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:16:48,668 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:16:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:16:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:16:50,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:16:50,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242741157] [2021-08-21 17:16:50,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242741157] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:16:50,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:16:50,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-08-21 17:16:50,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194770268] [2021-08-21 17:16:50,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-21 17:16:50,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:16:50,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-21 17:16:50,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=974, Unknown=0, NotChecked=0, Total=1056 [2021-08-21 17:16:50,074 INFO L87 Difference]: Start difference. First operand 522 states and 648 transitions. Second operand has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:16:54,808 INFO L93 Difference]: Finished difference Result 637 states and 793 transitions. [2021-08-21 17:16:54,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-08-21 17:16:54,808 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:16:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:16:54,809 INFO L225 Difference]: With dead ends: 637 [2021-08-21 17:16:54,809 INFO L226 Difference]: Without dead ends: 540 [2021-08-21 17:16:54,810 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 4540.9ms TimeCoverageRelationStatistics Valid=756, Invalid=3666, Unknown=0, NotChecked=0, Total=4422 [2021-08-21 17:16:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-08-21 17:16:54,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 521. [2021-08-21 17:16:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 1.2423076923076923) internal successors, (646), 520 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 646 transitions. [2021-08-21 17:16:54,814 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 646 transitions. Word has length 120 [2021-08-21 17:16:54,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:16:54,814 INFO L470 AbstractCegarLoop]: Abstraction has 521 states and 646 transitions. [2021-08-21 17:16:54,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:16:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 646 transitions. [2021-08-21 17:16:54,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:16:54,815 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:16:54,815 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:16:54,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-21 17:16:54,820 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:16:54,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:16:54,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1404737659, now seen corresponding path program 27 times [2021-08-21 17:16:54,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:16:54,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539450058] [2021-08-21 17:16:54,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:16:54,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:16:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:16:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:16:56,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:16:56,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539450058] [2021-08-21 17:16:56,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539450058] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:16:56,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:16:56,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-21 17:16:56,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262929759] [2021-08-21 17:16:56,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-21 17:16:56,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:16:56,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-21 17:16:56,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1163, Unknown=0, NotChecked=0, Total=1260 [2021-08-21 17:16:56,518 INFO L87 Difference]: Start difference. First operand 521 states and 646 transitions. Second operand has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:17:01,426 INFO L93 Difference]: Finished difference Result 637 states and 792 transitions. [2021-08-21 17:17:01,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-08-21 17:17:01,427 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:17:01,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:17:01,427 INFO L225 Difference]: With dead ends: 637 [2021-08-21 17:17:01,428 INFO L226 Difference]: Without dead ends: 527 [2021-08-21 17:17:01,428 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 4742.7ms TimeCoverageRelationStatistics Valid=919, Invalid=4631, Unknown=0, NotChecked=0, Total=5550 [2021-08-21 17:17:01,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-08-21 17:17:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 508. [2021-08-21 17:17:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 1.2465483234714003) internal successors, (632), 507 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 632 transitions. [2021-08-21 17:17:01,433 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 632 transitions. Word has length 120 [2021-08-21 17:17:01,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:17:01,433 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 632 transitions. [2021-08-21 17:17:01,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:01,433 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 632 transitions. [2021-08-21 17:17:01,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:17:01,434 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:17:01,434 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:17:01,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-08-21 17:17:01,434 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:17:01,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:17:01,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1977530121, now seen corresponding path program 28 times [2021-08-21 17:17:01,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:17:01,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951833218] [2021-08-21 17:17:01,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:17:01,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:17:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:17:02,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:17:02,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:17:02,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951833218] [2021-08-21 17:17:02,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951833218] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:17:02,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:17:02,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-08-21 17:17:02,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647788474] [2021-08-21 17:17:02,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-21 17:17:02,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:17:02,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-21 17:17:02,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=974, Unknown=0, NotChecked=0, Total=1056 [2021-08-21 17:17:02,805 INFO L87 Difference]: Start difference. First operand 508 states and 632 transitions. Second operand has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:06,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:17:06,697 INFO L93 Difference]: Finished difference Result 617 states and 770 transitions. [2021-08-21 17:17:06,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-21 17:17:06,697 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:17:06,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:17:06,698 INFO L225 Difference]: With dead ends: 617 [2021-08-21 17:17:06,698 INFO L226 Difference]: Without dead ends: 488 [2021-08-21 17:17:06,698 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 3714.2ms TimeCoverageRelationStatistics Valid=649, Invalid=3383, Unknown=0, NotChecked=0, Total=4032 [2021-08-21 17:17:06,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-08-21 17:17:06,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2021-08-21 17:17:06,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.2484599589322383) internal successors, (608), 487 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:06,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 608 transitions. [2021-08-21 17:17:06,702 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 608 transitions. Word has length 120 [2021-08-21 17:17:06,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:17:06,702 INFO L470 AbstractCegarLoop]: Abstraction has 488 states and 608 transitions. [2021-08-21 17:17:06,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:06,703 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 608 transitions. [2021-08-21 17:17:06,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:17:06,703 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:17:06,705 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:17:06,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-08-21 17:17:06,706 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:17:06,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:17:06,707 INFO L82 PathProgramCache]: Analyzing trace with hash -435838647, now seen corresponding path program 29 times [2021-08-21 17:17:06,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:17:06,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106700621] [2021-08-21 17:17:06,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:17:06,707 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:17:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:17:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:17:08,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:17:08,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106700621] [2021-08-21 17:17:08,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106700621] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:17:08,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:17:08,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:17:08,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411157015] [2021-08-21 17:17:08,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:17:08,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:17:08,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:17:08,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:17:08,194 INFO L87 Difference]: Start difference. First operand 488 states and 608 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:17:12,511 INFO L93 Difference]: Finished difference Result 585 states and 734 transitions. [2021-08-21 17:17:12,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-21 17:17:12,511 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:17:12,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:17:12,512 INFO L225 Difference]: With dead ends: 585 [2021-08-21 17:17:12,512 INFO L226 Difference]: Without dead ends: 476 [2021-08-21 17:17:12,512 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 4075.4ms TimeCoverageRelationStatistics Valid=671, Invalid=3619, Unknown=0, NotChecked=0, Total=4290 [2021-08-21 17:17:12,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2021-08-21 17:17:12,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2021-08-21 17:17:12,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 1.2294736842105263) internal successors, (584), 475 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 584 transitions. [2021-08-21 17:17:12,516 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 584 transitions. Word has length 120 [2021-08-21 17:17:12,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:17:12,518 INFO L470 AbstractCegarLoop]: Abstraction has 476 states and 584 transitions. [2021-08-21 17:17:12,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 584 transitions. [2021-08-21 17:17:12,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:17:12,518 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:17:12,519 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:17:12,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-08-21 17:17:12,519 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:17:12,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:17:12,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1015451361, now seen corresponding path program 30 times [2021-08-21 17:17:12,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:17:12,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100592427] [2021-08-21 17:17:12,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:17:12,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:17:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:17:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:17:13,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:17:13,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100592427] [2021-08-21 17:17:13,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100592427] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:17:13,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:17:13,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:17:13,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568165582] [2021-08-21 17:17:13,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:17:13,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:17:13,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:17:13,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:17:13,927 INFO L87 Difference]: Start difference. First operand 476 states and 584 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:17:18,785 INFO L93 Difference]: Finished difference Result 587 states and 731 transitions. [2021-08-21 17:17:18,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-08-21 17:17:18,785 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:17:18,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:17:18,786 INFO L225 Difference]: With dead ends: 587 [2021-08-21 17:17:18,786 INFO L226 Difference]: Without dead ends: 488 [2021-08-21 17:17:18,787 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 4814.2ms TimeCoverageRelationStatistics Valid=881, Invalid=4089, Unknown=0, NotChecked=0, Total=4970 [2021-08-21 17:17:18,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-08-21 17:17:18,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 481. [2021-08-21 17:17:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.2354166666666666) internal successors, (593), 480 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 593 transitions. [2021-08-21 17:17:18,790 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 593 transitions. Word has length 120 [2021-08-21 17:17:18,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:17:18,791 INFO L470 AbstractCegarLoop]: Abstraction has 481 states and 593 transitions. [2021-08-21 17:17:18,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:18,791 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 593 transitions. [2021-08-21 17:17:18,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:17:18,791 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:17:18,792 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:17:18,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-08-21 17:17:18,792 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:17:18,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:17:18,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1879477353, now seen corresponding path program 31 times [2021-08-21 17:17:18,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:17:18,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127513604] [2021-08-21 17:17:18,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:17:18,792 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:17:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:17:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:17:20,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:17:20,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127513604] [2021-08-21 17:17:20,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127513604] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:17:20,107 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:17:20,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:17:20,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502474106] [2021-08-21 17:17:20,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:17:20,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:17:20,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:17:20,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:17:20,108 INFO L87 Difference]: Start difference. First operand 481 states and 593 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:25,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:17:25,239 INFO L93 Difference]: Finished difference Result 581 states and 723 transitions. [2021-08-21 17:17:25,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-08-21 17:17:25,239 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:17:25,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:17:25,240 INFO L225 Difference]: With dead ends: 581 [2021-08-21 17:17:25,240 INFO L226 Difference]: Without dead ends: 487 [2021-08-21 17:17:25,241 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 4949.4ms TimeCoverageRelationStatistics Valid=832, Invalid=3998, Unknown=0, NotChecked=0, Total=4830 [2021-08-21 17:17:25,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2021-08-21 17:17:25,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 480. [2021-08-21 17:17:25,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.2338204592901878) internal successors, (591), 479 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) [2021-08-21 17:17:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 591 transitions. [2021-08-21 17:17:25,244 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 591 transitions. Word has length 120 [2021-08-21 17:17:25,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:17:25,245 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 591 transitions. [2021-08-21 17:17:25,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 591 transitions. [2021-08-21 17:17:25,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:17:25,245 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:17:25,245 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:17:25,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-08-21 17:17:25,247 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:17:25,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:17:25,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1438845969, now seen corresponding path program 32 times [2021-08-21 17:17:25,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:17:25,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310245927] [2021-08-21 17:17:25,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:17:25,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:17:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:17:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:17:26,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:17:26,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310245927] [2021-08-21 17:17:26,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310245927] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:17:26,702 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:17:26,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:17:26,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312412837] [2021-08-21 17:17:26,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:17:26,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:17:26,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:17:26,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:17:26,703 INFO L87 Difference]: Start difference. First operand 480 states and 591 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:31,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:17:31,571 INFO L93 Difference]: Finished difference Result 582 states and 723 transitions. [2021-08-21 17:17:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-08-21 17:17:31,572 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:17:31,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:17:31,572 INFO L225 Difference]: With dead ends: 582 [2021-08-21 17:17:31,572 INFO L226 Difference]: Without dead ends: 485 [2021-08-21 17:17:31,573 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 4668.0ms TimeCoverageRelationStatistics Valid=790, Invalid=3902, Unknown=0, NotChecked=0, Total=4692 [2021-08-21 17:17:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2021-08-21 17:17:31,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 478. [2021-08-21 17:17:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 1.230607966457023) internal successors, (587), 477 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:31,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 587 transitions. [2021-08-21 17:17:31,577 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 587 transitions. Word has length 120 [2021-08-21 17:17:31,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:17:31,577 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 587 transitions. [2021-08-21 17:17:31,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 587 transitions. [2021-08-21 17:17:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:17:31,577 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:17:31,578 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:17:31,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-08-21 17:17:31,578 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:17:31,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:17:31,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1696950451, now seen corresponding path program 33 times [2021-08-21 17:17:31,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:17:31,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968368905] [2021-08-21 17:17:31,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:17:31,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:17:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:17:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:17:32,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:17:32,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968368905] [2021-08-21 17:17:32,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968368905] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:17:32,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:17:32,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:17:32,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166844680] [2021-08-21 17:17:32,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:17:32,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:17:32,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:17:32,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:17:32,963 INFO L87 Difference]: Start difference. First operand 478 states and 587 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:37,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:17:37,603 INFO L93 Difference]: Finished difference Result 581 states and 720 transitions. [2021-08-21 17:17:37,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-21 17:17:37,603 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:17:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:17:37,604 INFO L225 Difference]: With dead ends: 581 [2021-08-21 17:17:37,604 INFO L226 Difference]: Without dead ends: 484 [2021-08-21 17:17:37,604 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 4473.1ms TimeCoverageRelationStatistics Valid=743, Invalid=3813, Unknown=0, NotChecked=0, Total=4556 [2021-08-21 17:17:37,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-08-21 17:17:37,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 477. [2021-08-21 17:17:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.2289915966386555) internal successors, (585), 476 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:37,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 585 transitions. [2021-08-21 17:17:37,608 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 585 transitions. Word has length 120 [2021-08-21 17:17:37,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:17:37,608 INFO L470 AbstractCegarLoop]: Abstraction has 477 states and 585 transitions. [2021-08-21 17:17:37,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 585 transitions. [2021-08-21 17:17:37,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:17:37,610 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:17:37,611 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:17:37,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-08-21 17:17:37,611 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:17:37,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:17:37,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1985755941, now seen corresponding path program 34 times [2021-08-21 17:17:37,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:17:37,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847237794] [2021-08-21 17:17:37,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:17:37,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:17:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:17:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:17:38,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:17:38,769 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847237794] [2021-08-21 17:17:38,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847237794] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:17:38,769 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:17:38,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:17:38,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132272171] [2021-08-21 17:17:38,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:17:38,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:17:38,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:17:38,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:17:38,778 INFO L87 Difference]: Start difference. First operand 477 states and 585 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:17:42,024 INFO L93 Difference]: Finished difference Result 574 states and 711 transitions. [2021-08-21 17:17:42,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-21 17:17:42,025 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:17:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:17:42,026 INFO L225 Difference]: With dead ends: 574 [2021-08-21 17:17:42,026 INFO L226 Difference]: Without dead ends: 464 [2021-08-21 17:17:42,027 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 3125.8ms TimeCoverageRelationStatistics Valid=680, Invalid=3610, Unknown=0, NotChecked=0, Total=4290 [2021-08-21 17:17:42,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-08-21 17:17:42,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2021-08-21 17:17:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 1.2095032397408207) internal successors, (560), 463 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 560 transitions. [2021-08-21 17:17:42,031 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 560 transitions. Word has length 120 [2021-08-21 17:17:42,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:17:42,031 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 560 transitions. [2021-08-21 17:17:42,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:42,031 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 560 transitions. [2021-08-21 17:17:42,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:17:42,031 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:17:42,032 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:17:42,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-08-21 17:17:42,032 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:17:42,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:17:42,032 INFO L82 PathProgramCache]: Analyzing trace with hash -512209441, now seen corresponding path program 35 times [2021-08-21 17:17:42,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:17:42,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121260209] [2021-08-21 17:17:42,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:17:42,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:17:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:17:43,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:17:43,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:17:43,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121260209] [2021-08-21 17:17:43,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121260209] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:17:43,603 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:17:43,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:17:43,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834512316] [2021-08-21 17:17:43,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:17:43,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:17:43,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:17:43,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:17:43,604 INFO L87 Difference]: Start difference. First operand 464 states and 560 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:17:48,937 INFO L93 Difference]: Finished difference Result 603 states and 751 transitions. [2021-08-21 17:17:48,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-08-21 17:17:48,937 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:17:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:17:48,938 INFO L225 Difference]: With dead ends: 603 [2021-08-21 17:17:48,938 INFO L226 Difference]: Without dead ends: 503 [2021-08-21 17:17:48,939 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 5193.4ms TimeCoverageRelationStatistics Valid=848, Invalid=3982, Unknown=0, NotChecked=0, Total=4830 [2021-08-21 17:17:48,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2021-08-21 17:17:48,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 470. [2021-08-21 17:17:48,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 1.2174840085287846) internal successors, (571), 469 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 571 transitions. [2021-08-21 17:17:48,942 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 571 transitions. Word has length 120 [2021-08-21 17:17:48,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:17:48,943 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 571 transitions. [2021-08-21 17:17:48,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 571 transitions. [2021-08-21 17:17:48,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:17:48,943 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:17:48,943 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:17:48,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-08-21 17:17:48,944 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:17:48,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:17:48,944 INFO L82 PathProgramCache]: Analyzing trace with hash -157288785, now seen corresponding path program 36 times [2021-08-21 17:17:48,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:17:48,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414716243] [2021-08-21 17:17:48,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:17:48,944 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:17:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:17:50,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:17:50,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:17:50,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414716243] [2021-08-21 17:17:50,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414716243] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:17:50,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:17:50,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:17:50,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518762640] [2021-08-21 17:17:50,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:17:50,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:17:50,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:17:50,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:17:50,424 INFO L87 Difference]: Start difference. First operand 470 states and 571 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:55,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:17:55,887 INFO L93 Difference]: Finished difference Result 601 states and 749 transitions. [2021-08-21 17:17:55,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-08-21 17:17:55,888 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:17:55,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:17:55,888 INFO L225 Difference]: With dead ends: 601 [2021-08-21 17:17:55,889 INFO L226 Difference]: Without dead ends: 502 [2021-08-21 17:17:55,889 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 5204.1ms TimeCoverageRelationStatistics Valid=818, Invalid=3874, Unknown=0, NotChecked=0, Total=4692 [2021-08-21 17:17:55,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-08-21 17:17:55,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 471. [2021-08-21 17:17:55,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.2191489361702128) internal successors, (573), 470 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:55,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 573 transitions. [2021-08-21 17:17:55,893 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 573 transitions. Word has length 120 [2021-08-21 17:17:55,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:17:55,893 INFO L470 AbstractCegarLoop]: Abstraction has 471 states and 573 transitions. [2021-08-21 17:17:55,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:17:55,893 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 573 transitions. [2021-08-21 17:17:55,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:17:55,894 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:17:55,894 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:17:55,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-08-21 17:17:55,894 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:17:55,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:17:55,895 INFO L82 PathProgramCache]: Analyzing trace with hash -182896737, now seen corresponding path program 37 times [2021-08-21 17:17:55,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:17:55,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334495707] [2021-08-21 17:17:55,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:17:55,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:17:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:17:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:17:57,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:17:57,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334495707] [2021-08-21 17:17:57,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334495707] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:17:57,236 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:17:57,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:17:57,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860616570] [2021-08-21 17:17:57,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:17:57,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:17:57,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:17:57,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:17:57,237 INFO L87 Difference]: Start difference. First operand 471 states and 573 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:18:02,349 INFO L93 Difference]: Finished difference Result 591 states and 735 transitions. [2021-08-21 17:18:02,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-21 17:18:02,350 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:18:02,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:18:02,350 INFO L225 Difference]: With dead ends: 591 [2021-08-21 17:18:02,350 INFO L226 Difference]: Without dead ends: 492 [2021-08-21 17:18:02,351 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 4882.7ms TimeCoverageRelationStatistics Valid=791, Invalid=3765, Unknown=0, NotChecked=0, Total=4556 [2021-08-21 17:18:02,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-08-21 17:18:02,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 473. [2021-08-21 17:18:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 1.222457627118644) internal successors, (577), 472 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 577 transitions. [2021-08-21 17:18:02,354 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 577 transitions. Word has length 120 [2021-08-21 17:18:02,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:18:02,355 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 577 transitions. [2021-08-21 17:18:02,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:02,355 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 577 transitions. [2021-08-21 17:18:02,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:18:02,355 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:18:02,355 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:18:02,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-08-21 17:18:02,356 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:18:02,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:18:02,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1127645535, now seen corresponding path program 38 times [2021-08-21 17:18:02,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:18:02,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349996913] [2021-08-21 17:18:02,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:18:02,356 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:18:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:18:03,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:18:03,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:18:03,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349996913] [2021-08-21 17:18:03,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349996913] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:18:03,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:18:03,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:18:03,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380568409] [2021-08-21 17:18:03,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:18:03,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:18:03,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:18:03,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:18:03,721 INFO L87 Difference]: Start difference. First operand 473 states and 577 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:18:08,150 INFO L93 Difference]: Finished difference Result 580 states and 719 transitions. [2021-08-21 17:18:08,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-21 17:18:08,150 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:18:08,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:18:08,151 INFO L225 Difference]: With dead ends: 580 [2021-08-21 17:18:08,151 INFO L226 Difference]: Without dead ends: 484 [2021-08-21 17:18:08,151 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 4331.0ms TimeCoverageRelationStatistics Valid=767, Invalid=3655, Unknown=0, NotChecked=0, Total=4422 [2021-08-21 17:18:08,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-08-21 17:18:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 474. [2021-08-21 17:18:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 1.2241014799154335) internal successors, (579), 473 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 579 transitions. [2021-08-21 17:18:08,155 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 579 transitions. Word has length 120 [2021-08-21 17:18:08,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:18:08,155 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 579 transitions. [2021-08-21 17:18:08,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:08,155 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 579 transitions. [2021-08-21 17:18:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:18:08,156 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:18:08,156 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:18:08,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-08-21 17:18:08,156 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:18:08,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:18:08,157 INFO L82 PathProgramCache]: Analyzing trace with hash -723492049, now seen corresponding path program 39 times [2021-08-21 17:18:08,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:18:08,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408564412] [2021-08-21 17:18:08,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:18:08,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:18:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:18:09,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:18:09,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:18:09,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408564412] [2021-08-21 17:18:09,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408564412] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:18:09,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:18:09,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:18:09,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939480767] [2021-08-21 17:18:09,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:18:09,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:18:09,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:18:09,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:18:09,585 INFO L87 Difference]: Start difference. First operand 474 states and 579 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:14,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:18:14,235 INFO L93 Difference]: Finished difference Result 570 states and 705 transitions. [2021-08-21 17:18:14,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-21 17:18:14,235 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:18:14,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:18:14,236 INFO L225 Difference]: With dead ends: 570 [2021-08-21 17:18:14,236 INFO L226 Difference]: Without dead ends: 474 [2021-08-21 17:18:14,236 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 4491.5ms TimeCoverageRelationStatistics Valid=729, Invalid=3431, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:18:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-08-21 17:18:14,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2021-08-21 17:18:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 1.221987315010571) internal successors, (578), 473 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 578 transitions. [2021-08-21 17:18:14,240 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 578 transitions. Word has length 120 [2021-08-21 17:18:14,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:18:14,240 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 578 transitions. [2021-08-21 17:18:14,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:14,240 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 578 transitions. [2021-08-21 17:18:14,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:18:14,241 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:18:14,241 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:18:14,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-08-21 17:18:14,241 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:18:14,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:18:14,241 INFO L82 PathProgramCache]: Analyzing trace with hash 283973611, now seen corresponding path program 40 times [2021-08-21 17:18:14,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:18:14,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729719585] [2021-08-21 17:18:14,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:18:14,241 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:18:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:18:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:18:15,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:18:15,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729719585] [2021-08-21 17:18:15,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729719585] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:18:15,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:18:15,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:18:15,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548316022] [2021-08-21 17:18:15,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:18:15,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:18:15,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:18:15,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:18:15,790 INFO L87 Difference]: Start difference. First operand 474 states and 578 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:19,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:18:19,768 INFO L93 Difference]: Finished difference Result 568 states and 701 transitions. [2021-08-21 17:18:19,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-21 17:18:19,768 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:18:19,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:18:19,769 INFO L225 Difference]: With dead ends: 568 [2021-08-21 17:18:19,769 INFO L226 Difference]: Without dead ends: 473 [2021-08-21 17:18:19,769 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 3894.0ms TimeCoverageRelationStatistics Valid=708, Invalid=3452, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:18:19,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-08-21 17:18:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2021-08-21 17:18:19,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 1.2203389830508475) internal successors, (576), 472 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 576 transitions. [2021-08-21 17:18:19,773 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 576 transitions. Word has length 120 [2021-08-21 17:18:19,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:18:19,773 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 576 transitions. [2021-08-21 17:18:19,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 576 transitions. [2021-08-21 17:18:19,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:18:19,774 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:18:19,774 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:18:19,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-08-21 17:18:19,774 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:18:19,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:18:19,775 INFO L82 PathProgramCache]: Analyzing trace with hash 160917617, now seen corresponding path program 41 times [2021-08-21 17:18:19,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:18:19,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614913792] [2021-08-21 17:18:19,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:18:19,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:18:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:18:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:18:20,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:18:20,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614913792] [2021-08-21 17:18:20,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614913792] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:18:20,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:18:20,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:18:20,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181410966] [2021-08-21 17:18:20,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:18:20,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:18:20,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:18:20,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:18:20,970 INFO L87 Difference]: Start difference. First operand 473 states and 576 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:18:24,677 INFO L93 Difference]: Finished difference Result 574 states and 709 transitions. [2021-08-21 17:18:24,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-21 17:18:24,678 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:18:24,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:18:24,678 INFO L225 Difference]: With dead ends: 574 [2021-08-21 17:18:24,678 INFO L226 Difference]: Without dead ends: 480 [2021-08-21 17:18:24,679 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 3508.3ms TimeCoverageRelationStatistics Valid=749, Invalid=3673, Unknown=0, NotChecked=0, Total=4422 [2021-08-21 17:18:24,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-08-21 17:18:24,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 475. [2021-08-21 17:18:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 474 states have (on average 1.2215189873417722) internal successors, (579), 474 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 579 transitions. [2021-08-21 17:18:24,683 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 579 transitions. Word has length 120 [2021-08-21 17:18:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:18:24,683 INFO L470 AbstractCegarLoop]: Abstraction has 475 states and 579 transitions. [2021-08-21 17:18:24,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:24,683 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 579 transitions. [2021-08-21 17:18:24,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:18:24,684 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:18:24,684 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:18:24,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-08-21 17:18:24,684 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:18:24,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:18:24,684 INFO L82 PathProgramCache]: Analyzing trace with hash 601549001, now seen corresponding path program 42 times [2021-08-21 17:18:24,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:18:24,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023537789] [2021-08-21 17:18:24,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:18:24,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:18:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:18:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:18:26,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:18:26,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023537789] [2021-08-21 17:18:26,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023537789] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:18:26,010 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:18:26,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:18:26,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820294841] [2021-08-21 17:18:26,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:18:26,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:18:26,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:18:26,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:18:26,011 INFO L87 Difference]: Start difference. First operand 475 states and 579 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:29,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:18:29,208 INFO L93 Difference]: Finished difference Result 570 states and 703 transitions. [2021-08-21 17:18:29,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-21 17:18:29,209 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:18:29,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:18:29,209 INFO L225 Difference]: With dead ends: 570 [2021-08-21 17:18:29,209 INFO L226 Difference]: Without dead ends: 471 [2021-08-21 17:18:29,210 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 3142.3ms TimeCoverageRelationStatistics Valid=687, Invalid=3473, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:18:29,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-08-21 17:18:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2021-08-21 17:18:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.2170212765957447) internal successors, (572), 470 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 572 transitions. [2021-08-21 17:18:29,213 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 572 transitions. Word has length 120 [2021-08-21 17:18:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:18:29,214 INFO L470 AbstractCegarLoop]: Abstraction has 471 states and 572 transitions. [2021-08-21 17:18:29,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 572 transitions. [2021-08-21 17:18:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:18:29,214 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:18:29,215 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:18:29,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-08-21 17:18:29,215 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:18:29,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:18:29,215 INFO L82 PathProgramCache]: Analyzing trace with hash -737350381, now seen corresponding path program 43 times [2021-08-21 17:18:29,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:18:29,216 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961464163] [2021-08-21 17:18:29,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:18:29,216 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:18:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:18:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:18:30,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:18:30,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961464163] [2021-08-21 17:18:30,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961464163] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:18:30,586 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:18:30,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:18:30,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499626430] [2021-08-21 17:18:30,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:18:30,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:18:30,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:18:30,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:18:30,588 INFO L87 Difference]: Start difference. First operand 471 states and 572 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:18:35,236 INFO L93 Difference]: Finished difference Result 574 states and 708 transitions. [2021-08-21 17:18:35,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-21 17:18:35,236 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:18:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:18:35,237 INFO L225 Difference]: With dead ends: 574 [2021-08-21 17:18:35,237 INFO L226 Difference]: Without dead ends: 480 [2021-08-21 17:18:35,238 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 4402.5ms TimeCoverageRelationStatistics Valid=775, Invalid=3781, Unknown=0, NotChecked=0, Total=4556 [2021-08-21 17:18:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-08-21 17:18:35,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 474. [2021-08-21 17:18:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 1.2198731501057083) internal successors, (577), 473 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 577 transitions. [2021-08-21 17:18:35,241 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 577 transitions. Word has length 120 [2021-08-21 17:18:35,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:18:35,242 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 577 transitions. [2021-08-21 17:18:35,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 577 transitions. [2021-08-21 17:18:35,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:18:35,242 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:18:35,242 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:18:35,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-08-21 17:18:35,243 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:18:35,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:18:35,243 INFO L82 PathProgramCache]: Analyzing trace with hash -296718997, now seen corresponding path program 44 times [2021-08-21 17:18:35,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:18:35,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773335415] [2021-08-21 17:18:35,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:18:35,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:18:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:18:36,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:18:36,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:18:36,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773335415] [2021-08-21 17:18:36,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773335415] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:18:36,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:18:36,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:18:36,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503503080] [2021-08-21 17:18:36,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:18:36,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:18:36,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:18:36,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:18:36,650 INFO L87 Difference]: Start difference. First operand 474 states and 577 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:41,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:18:41,032 INFO L93 Difference]: Finished difference Result 575 states and 708 transitions. [2021-08-21 17:18:41,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-21 17:18:41,033 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:18:41,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:18:41,034 INFO L225 Difference]: With dead ends: 575 [2021-08-21 17:18:41,034 INFO L226 Difference]: Without dead ends: 478 [2021-08-21 17:18:41,034 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 4247.6ms TimeCoverageRelationStatistics Valid=731, Invalid=3691, Unknown=0, NotChecked=0, Total=4422 [2021-08-21 17:18:41,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-08-21 17:18:41,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 472. [2021-08-21 17:18:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.21656050955414) internal successors, (573), 471 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:41,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 573 transitions. [2021-08-21 17:18:41,038 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 573 transitions. Word has length 120 [2021-08-21 17:18:41,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:18:41,038 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 573 transitions. [2021-08-21 17:18:41,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:41,038 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 573 transitions. [2021-08-21 17:18:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:18:41,039 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:18:41,039 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:18:41,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-08-21 17:18:41,039 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:18:41,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:18:41,040 INFO L82 PathProgramCache]: Analyzing trace with hash -554823479, now seen corresponding path program 45 times [2021-08-21 17:18:41,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:18:41,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916623875] [2021-08-21 17:18:41,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:18:41,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:18:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:18:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:18:42,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:18:42,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916623875] [2021-08-21 17:18:42,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916623875] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:18:42,161 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:18:42,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:18:42,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126298847] [2021-08-21 17:18:42,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:18:42,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:18:42,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:18:42,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:18:42,162 INFO L87 Difference]: Start difference. First operand 472 states and 573 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:45,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:18:45,302 INFO L93 Difference]: Finished difference Result 568 states and 698 transitions. [2021-08-21 17:18:45,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-21 17:18:45,303 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:18:45,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:18:45,303 INFO L225 Difference]: With dead ends: 568 [2021-08-21 17:18:45,303 INFO L226 Difference]: Without dead ends: 470 [2021-08-21 17:18:45,304 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 3064.9ms TimeCoverageRelationStatistics Valid=670, Invalid=3490, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:18:45,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-08-21 17:18:45,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2021-08-21 17:18:45,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 1.2153518123667377) internal successors, (570), 469 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 570 transitions. [2021-08-21 17:18:45,307 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 570 transitions. Word has length 120 [2021-08-21 17:18:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:18:45,307 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 570 transitions. [2021-08-21 17:18:45,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:45,308 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 570 transitions. [2021-08-21 17:18:45,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:18:45,308 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:18:45,308 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:18:45,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-08-21 17:18:45,309 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:18:45,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:18:45,309 INFO L82 PathProgramCache]: Analyzing trace with hash -524388697, now seen corresponding path program 46 times [2021-08-21 17:18:45,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:18:45,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226079356] [2021-08-21 17:18:45,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:18:45,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:18:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:18:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:18:46,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:18:46,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226079356] [2021-08-21 17:18:46,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226079356] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:18:46,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:18:46,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:18:46,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744475147] [2021-08-21 17:18:46,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:18:46,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:18:46,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:18:46,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:18:46,634 INFO L87 Difference]: Start difference. First operand 470 states and 570 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:18:51,568 INFO L93 Difference]: Finished difference Result 570 states and 700 transitions. [2021-08-21 17:18:51,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-08-21 17:18:51,569 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:18:51,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:18:51,569 INFO L225 Difference]: With dead ends: 570 [2021-08-21 17:18:51,569 INFO L226 Difference]: Without dead ends: 476 [2021-08-21 17:18:51,570 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 4734.4ms TimeCoverageRelationStatistics Valid=804, Invalid=3888, Unknown=0, NotChecked=0, Total=4692 [2021-08-21 17:18:51,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2021-08-21 17:18:51,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 469. [2021-08-21 17:18:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 1.2136752136752136) internal successors, (568), 468 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 568 transitions. [2021-08-21 17:18:51,573 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 568 transitions. Word has length 120 [2021-08-21 17:18:51,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:18:51,573 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 568 transitions. [2021-08-21 17:18:51,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 568 transitions. [2021-08-21 17:18:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:18:51,574 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:18:51,574 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:18:51,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-08-21 17:18:51,575 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:18:51,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:18:51,575 INFO L82 PathProgramCache]: Analyzing trace with hash -83757313, now seen corresponding path program 47 times [2021-08-21 17:18:51,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:18:51,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589023451] [2021-08-21 17:18:51,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:18:51,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:18:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:18:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:18:52,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:18:52,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589023451] [2021-08-21 17:18:52,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589023451] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:18:52,768 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:18:52,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:18:52,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422679140] [2021-08-21 17:18:52,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:18:52,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:18:52,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:18:52,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:18:52,769 INFO L87 Difference]: Start difference. First operand 469 states and 568 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:57,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:18:57,429 INFO L93 Difference]: Finished difference Result 571 states and 700 transitions. [2021-08-21 17:18:57,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-21 17:18:57,429 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:18:57,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:18:57,430 INFO L225 Difference]: With dead ends: 571 [2021-08-21 17:18:57,430 INFO L226 Difference]: Without dead ends: 474 [2021-08-21 17:18:57,430 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 4364.2ms TimeCoverageRelationStatistics Valid=759, Invalid=3797, Unknown=0, NotChecked=0, Total=4556 [2021-08-21 17:18:57,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-08-21 17:18:57,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 467. [2021-08-21 17:18:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 1.2103004291845494) internal successors, (564), 466 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 564 transitions. [2021-08-21 17:18:57,434 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 564 transitions. Word has length 120 [2021-08-21 17:18:57,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:18:57,434 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 564 transitions. [2021-08-21 17:18:57,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:18:57,435 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 564 transitions. [2021-08-21 17:18:57,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:18:57,435 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:18:57,435 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:18:57,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-08-21 17:18:57,436 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:18:57,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:18:57,436 INFO L82 PathProgramCache]: Analyzing trace with hash -341861795, now seen corresponding path program 48 times [2021-08-21 17:18:57,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:18:57,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247704556] [2021-08-21 17:18:57,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:18:57,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:18:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:18:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:18:58,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:18:58,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247704556] [2021-08-21 17:18:58,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247704556] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:18:58,829 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:18:58,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:18:58,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518565004] [2021-08-21 17:18:58,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:18:58,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:18:58,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:18:58,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:18:58,830 INFO L87 Difference]: Start difference. First operand 467 states and 564 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:03,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:19:03,246 INFO L93 Difference]: Finished difference Result 570 states and 697 transitions. [2021-08-21 17:19:03,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-21 17:19:03,247 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:19:03,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:19:03,247 INFO L225 Difference]: With dead ends: 570 [2021-08-21 17:19:03,247 INFO L226 Difference]: Without dead ends: 473 [2021-08-21 17:19:03,248 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 4255.8ms TimeCoverageRelationStatistics Valid=717, Invalid=3705, Unknown=0, NotChecked=0, Total=4422 [2021-08-21 17:19:03,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-08-21 17:19:03,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 466. [2021-08-21 17:19:03,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 1.2086021505376343) internal successors, (562), 465 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 562 transitions. [2021-08-21 17:19:03,251 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 562 transitions. Word has length 120 [2021-08-21 17:19:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:19:03,251 INFO L470 AbstractCegarLoop]: Abstraction has 466 states and 562 transitions. [2021-08-21 17:19:03,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:03,253 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 562 transitions. [2021-08-21 17:19:03,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:19:03,253 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:19:03,253 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:19:03,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-08-21 17:19:03,259 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:19:03,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:19:03,260 INFO L82 PathProgramCache]: Analyzing trace with hash -630667285, now seen corresponding path program 49 times [2021-08-21 17:19:03,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:19:03,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529010055] [2021-08-21 17:19:03,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:19:03,260 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:19:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:19:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:19:04,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:19:04,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529010055] [2021-08-21 17:19:04,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529010055] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:19:04,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:19:04,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:19:04,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080452646] [2021-08-21 17:19:04,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:19:04,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:19:04,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:19:04,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:19:04,746 INFO L87 Difference]: Start difference. First operand 466 states and 562 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:09,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:19:09,060 INFO L93 Difference]: Finished difference Result 563 states and 688 transitions. [2021-08-21 17:19:09,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-21 17:19:09,060 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:19:09,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:19:09,061 INFO L225 Difference]: With dead ends: 563 [2021-08-21 17:19:09,061 INFO L226 Difference]: Without dead ends: 368 [2021-08-21 17:19:09,061 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 4313.9ms TimeCoverageRelationStatistics Valid=653, Invalid=3507, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:19:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-08-21 17:19:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2021-08-21 17:19:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 1.231607629427793) internal successors, (452), 367 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 452 transitions. [2021-08-21 17:19:09,064 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 452 transitions. Word has length 120 [2021-08-21 17:19:09,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:19:09,064 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 452 transitions. [2021-08-21 17:19:09,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 452 transitions. [2021-08-21 17:19:09,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:19:09,065 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:19:09,065 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:19:09,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-08-21 17:19:09,065 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:19:09,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:19:09,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1601900119, now seen corresponding path program 50 times [2021-08-21 17:19:09,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:19:09,066 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784066561] [2021-08-21 17:19:09,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:19:09,066 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:19:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:19:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:19:10,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:19:10,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784066561] [2021-08-21 17:19:10,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784066561] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:19:10,555 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:19:10,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:19:10,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27314839] [2021-08-21 17:19:10,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:19:10,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:19:10,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:19:10,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:19:10,556 INFO L87 Difference]: Start difference. First operand 368 states and 452 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:19:15,964 INFO L93 Difference]: Finished difference Result 476 states and 594 transitions. [2021-08-21 17:19:15,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-08-21 17:19:15,965 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:19:15,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:19:15,965 INFO L225 Difference]: With dead ends: 476 [2021-08-21 17:19:15,965 INFO L226 Difference]: Without dead ends: 369 [2021-08-21 17:19:15,966 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 5283.6ms TimeCoverageRelationStatistics Valid=848, Invalid=3982, Unknown=0, NotChecked=0, Total=4830 [2021-08-21 17:19:15,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-08-21 17:19:15,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 363. [2021-08-21 17:19:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 1.2348066298342542) internal successors, (447), 362 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:15,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 447 transitions. [2021-08-21 17:19:15,970 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 447 transitions. Word has length 120 [2021-08-21 17:19:15,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:19:15,970 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 447 transitions. [2021-08-21 17:19:15,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:15,970 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 447 transitions. [2021-08-21 17:19:15,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:19:15,971 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:19:15,971 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:19:15,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-08-21 17:19:15,971 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:19:15,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:19:15,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1277964813, now seen corresponding path program 51 times [2021-08-21 17:19:15,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:19:15,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886518811] [2021-08-21 17:19:15,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:19:15,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:19:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:19:17,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:19:17,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:19:17,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886518811] [2021-08-21 17:19:17,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886518811] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:19:17,218 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:19:17,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:19:17,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668016413] [2021-08-21 17:19:17,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:19:17,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:19:17,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:19:17,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:19:17,219 INFO L87 Difference]: Start difference. First operand 363 states and 447 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:19:22,440 INFO L93 Difference]: Finished difference Result 494 states and 625 transitions. [2021-08-21 17:19:22,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-08-21 17:19:22,440 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:19:22,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:19:22,441 INFO L225 Difference]: With dead ends: 494 [2021-08-21 17:19:22,441 INFO L226 Difference]: Without dead ends: 388 [2021-08-21 17:19:22,441 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 4978.2ms TimeCoverageRelationStatistics Valid=818, Invalid=3874, Unknown=0, NotChecked=0, Total=4692 [2021-08-21 17:19:22,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-08-21 17:19:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 357. [2021-08-21 17:19:22,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 1.2387640449438202) internal successors, (441), 356 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:22,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 441 transitions. [2021-08-21 17:19:22,445 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 441 transitions. Word has length 120 [2021-08-21 17:19:22,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:19:22,445 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 441 transitions. [2021-08-21 17:19:22,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:22,445 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 441 transitions. [2021-08-21 17:19:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:19:22,446 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:19:22,446 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:19:22,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-08-21 17:19:22,446 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:19:22,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:19:22,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1155540469, now seen corresponding path program 52 times [2021-08-21 17:19:22,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:19:22,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989186450] [2021-08-21 17:19:22,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:19:22,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:19:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:19:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:19:23,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:19:23,623 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989186450] [2021-08-21 17:19:23,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989186450] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:19:23,623 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:19:23,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:19:23,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021391397] [2021-08-21 17:19:23,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:19:23,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:19:23,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:19:23,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:19:23,624 INFO L87 Difference]: Start difference. First operand 357 states and 441 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:29,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:19:29,209 INFO L93 Difference]: Finished difference Result 477 states and 603 transitions. [2021-08-21 17:19:29,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-21 17:19:29,209 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:19:29,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:19:29,210 INFO L225 Difference]: With dead ends: 477 [2021-08-21 17:19:29,210 INFO L226 Difference]: Without dead ends: 364 [2021-08-21 17:19:29,210 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 5246.9ms TimeCoverageRelationStatistics Valid=791, Invalid=3765, Unknown=0, NotChecked=0, Total=4556 [2021-08-21 17:19:29,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-08-21 17:19:29,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 345. [2021-08-21 17:19:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 1.247093023255814) internal successors, (429), 344 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 429 transitions. [2021-08-21 17:19:29,213 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 429 transitions. Word has length 120 [2021-08-21 17:19:29,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:19:29,214 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 429 transitions. [2021-08-21 17:19:29,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 429 transitions. [2021-08-21 17:19:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:19:29,214 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:19:29,214 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:19:29,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-08-21 17:19:29,215 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:19:29,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:19:29,215 INFO L82 PathProgramCache]: Analyzing trace with hash -340970349, now seen corresponding path program 53 times [2021-08-21 17:19:29,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:19:29,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90422456] [2021-08-21 17:19:29,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:19:29,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:19:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:19:30,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:19:30,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:19:30,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90422456] [2021-08-21 17:19:30,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90422456] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:19:30,812 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:19:30,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:19:30,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384183341] [2021-08-21 17:19:30,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:19:30,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:19:30,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:19:30,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:19:30,813 INFO L87 Difference]: Start difference. First operand 345 states and 429 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:36,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:19:36,420 INFO L93 Difference]: Finished difference Result 452 states and 571 transitions. [2021-08-21 17:19:36,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-21 17:19:36,420 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:19:36,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:19:36,421 INFO L225 Difference]: With dead ends: 452 [2021-08-21 17:19:36,421 INFO L226 Difference]: Without dead ends: 349 [2021-08-21 17:19:36,421 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 5471.0ms TimeCoverageRelationStatistics Valid=767, Invalid=3655, Unknown=0, NotChecked=0, Total=4422 [2021-08-21 17:19:36,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-08-21 17:19:36,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 339. [2021-08-21 17:19:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.2514792899408285) internal successors, (423), 338 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:36,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 423 transitions. [2021-08-21 17:19:36,424 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 423 transitions. Word has length 120 [2021-08-21 17:19:36,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:19:36,424 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 423 transitions. [2021-08-21 17:19:36,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:36,424 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 423 transitions. [2021-08-21 17:19:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:19:36,425 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:19:36,425 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:19:36,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-08-21 17:19:36,425 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:19:36,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:19:36,425 INFO L82 PathProgramCache]: Analyzing trace with hash 2085374135, now seen corresponding path program 54 times [2021-08-21 17:19:36,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:19:36,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561657558] [2021-08-21 17:19:36,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:19:36,425 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:19:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:19:38,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:19:38,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:19:38,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561657558] [2021-08-21 17:19:38,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561657558] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:19:38,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:19:38,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:19:38,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216365804] [2021-08-21 17:19:38,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:19:38,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:19:38,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:19:38,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:19:38,151 INFO L87 Difference]: Start difference. First operand 339 states and 423 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:42,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:19:42,990 INFO L93 Difference]: Finished difference Result 435 states and 549 transitions. [2021-08-21 17:19:42,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-21 17:19:42,990 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:19:42,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:19:42,991 INFO L225 Difference]: With dead ends: 435 [2021-08-21 17:19:42,991 INFO L226 Difference]: Without dead ends: 325 [2021-08-21 17:19:42,991 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 4762.7ms TimeCoverageRelationStatistics Valid=729, Invalid=3431, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:19:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-08-21 17:19:42,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-08-21 17:19:42,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.2561728395061729) internal successors, (407), 324 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 407 transitions. [2021-08-21 17:19:42,994 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 407 transitions. Word has length 120 [2021-08-21 17:19:42,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:19:42,994 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 407 transitions. [2021-08-21 17:19:42,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 407 transitions. [2021-08-21 17:19:42,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:19:42,995 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:19:42,995 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:19:42,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-08-21 17:19:42,995 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:19:42,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:19:42,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1511005079, now seen corresponding path program 55 times [2021-08-21 17:19:42,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:19:42,995 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321565966] [2021-08-21 17:19:42,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:19:42,996 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:19:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:19:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:19:44,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:19:44,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321565966] [2021-08-21 17:19:44,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321565966] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:19:44,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:19:44,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:19:44,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564134151] [2021-08-21 17:19:44,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:19:44,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:19:44,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:19:44,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:19:44,622 INFO L87 Difference]: Start difference. First operand 325 states and 407 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:48,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:19:48,860 INFO L93 Difference]: Finished difference Result 365 states and 454 transitions. [2021-08-21 17:19:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-21 17:19:48,861 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:19:48,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:19:48,861 INFO L225 Difference]: With dead ends: 365 [2021-08-21 17:19:48,861 INFO L226 Difference]: Without dead ends: 237 [2021-08-21 17:19:48,862 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 4150.2ms TimeCoverageRelationStatistics Valid=653, Invalid=3507, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:19:48,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-08-21 17:19:48,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2021-08-21 17:19:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 236 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 292 transitions. [2021-08-21 17:19:48,864 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 292 transitions. Word has length 120 [2021-08-21 17:19:48,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:19:48,864 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 292 transitions. [2021-08-21 17:19:48,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:48,864 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 292 transitions. [2021-08-21 17:19:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:19:48,864 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:19:48,864 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:19:48,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-08-21 17:19:48,865 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:19:48,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:19:48,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1038705745, now seen corresponding path program 56 times [2021-08-21 17:19:48,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:19:48,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025420374] [2021-08-21 17:19:48,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:19:48,865 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:19:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:19:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:19:50,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:19:50,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025420374] [2021-08-21 17:19:50,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025420374] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:19:50,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:19:50,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:19:50,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725022220] [2021-08-21 17:19:50,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:19:50,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:19:50,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:19:50,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:19:50,572 INFO L87 Difference]: Start difference. First operand 237 states and 292 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:55,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:19:55,452 INFO L93 Difference]: Finished difference Result 368 states and 470 transitions. [2021-08-21 17:19:55,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-08-21 17:19:55,453 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:19:55,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:19:55,453 INFO L225 Difference]: With dead ends: 368 [2021-08-21 17:19:55,453 INFO L226 Difference]: Without dead ends: 269 [2021-08-21 17:19:55,454 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 4936.4ms TimeCoverageRelationStatistics Valid=818, Invalid=3874, Unknown=0, NotChecked=0, Total=4692 [2021-08-21 17:19:55,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-08-21 17:19:55,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 233. [2021-08-21 17:19:55,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.228448275862069) internal successors, (285), 232 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 285 transitions. [2021-08-21 17:19:55,456 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 285 transitions. Word has length 120 [2021-08-21 17:19:55,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:19:55,456 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 285 transitions. [2021-08-21 17:19:55,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:19:55,456 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 285 transitions. [2021-08-21 17:19:55,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:19:55,457 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:19:55,457 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:19:55,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-08-21 17:19:55,457 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:19:55,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:19:55,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1064313697, now seen corresponding path program 57 times [2021-08-21 17:19:55,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:19:55,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104335803] [2021-08-21 17:19:55,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:19:55,457 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:19:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:19:56,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:19:56,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:19:56,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104335803] [2021-08-21 17:19:56,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104335803] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:19:56,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:19:56,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:19:56,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110003925] [2021-08-21 17:19:56,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:19:56,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:19:56,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:19:56,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:19:56,834 INFO L87 Difference]: Start difference. First operand 233 states and 285 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:20:01,957 INFO L93 Difference]: Finished difference Result 358 states and 456 transitions. [2021-08-21 17:20:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-21 17:20:01,957 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:20:01,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:20:01,957 INFO L225 Difference]: With dead ends: 358 [2021-08-21 17:20:01,957 INFO L226 Difference]: Without dead ends: 259 [2021-08-21 17:20:01,958 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 4910.1ms TimeCoverageRelationStatistics Valid=791, Invalid=3765, Unknown=0, NotChecked=0, Total=4556 [2021-08-21 17:20:01,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-08-21 17:20:01,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 234. [2021-08-21 17:20:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.2317596566523605) internal successors, (287), 233 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 287 transitions. [2021-08-21 17:20:01,960 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 287 transitions. Word has length 120 [2021-08-21 17:20:01,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:20:01,960 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 287 transitions. [2021-08-21 17:20:01,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:01,960 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 287 transitions. [2021-08-21 17:20:01,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:20:01,961 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:20:01,961 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:20:01,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-08-21 17:20:01,961 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:20:01,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:20:01,961 INFO L82 PathProgramCache]: Analyzing trace with hash 246228575, now seen corresponding path program 58 times [2021-08-21 17:20:01,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:20:01,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539017355] [2021-08-21 17:20:01,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:20:01,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:20:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:20:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:20:03,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:20:03,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539017355] [2021-08-21 17:20:03,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539017355] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:20:03,567 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:20:03,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:20:03,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426724793] [2021-08-21 17:20:03,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:20:03,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:20:03,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:20:03,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:20:03,568 INFO L87 Difference]: Start difference. First operand 234 states and 287 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:08,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:20:08,443 INFO L93 Difference]: Finished difference Result 347 states and 440 transitions. [2021-08-21 17:20:08,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-21 17:20:08,443 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:20:08,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:20:08,444 INFO L225 Difference]: With dead ends: 347 [2021-08-21 17:20:08,444 INFO L226 Difference]: Without dead ends: 251 [2021-08-21 17:20:08,444 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 4872.8ms TimeCoverageRelationStatistics Valid=767, Invalid=3655, Unknown=0, NotChecked=0, Total=4422 [2021-08-21 17:20:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-08-21 17:20:08,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 236. [2021-08-21 17:20:08,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.2382978723404254) internal successors, (291), 235 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:08,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 291 transitions. [2021-08-21 17:20:08,446 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 291 transitions. Word has length 120 [2021-08-21 17:20:08,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:20:08,446 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 291 transitions. [2021-08-21 17:20:08,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:08,447 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 291 transitions. [2021-08-21 17:20:08,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:20:08,448 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:20:08,448 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:20:08,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-08-21 17:20:08,448 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:20:08,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:20:08,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1604909009, now seen corresponding path program 59 times [2021-08-21 17:20:08,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:20:08,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090865995] [2021-08-21 17:20:08,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:20:08,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:20:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:20:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:20:09,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:20:09,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090865995] [2021-08-21 17:20:09,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090865995] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:20:09,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:20:09,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:20:09,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662226418] [2021-08-21 17:20:09,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:20:09,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:20:09,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:20:09,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:20:09,864 INFO L87 Difference]: Start difference. First operand 236 states and 291 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:14,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:20:14,399 INFO L93 Difference]: Finished difference Result 337 states and 426 transitions. [2021-08-21 17:20:14,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-21 17:20:14,399 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:20:14,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:20:14,400 INFO L225 Difference]: With dead ends: 337 [2021-08-21 17:20:14,400 INFO L226 Difference]: Without dead ends: 241 [2021-08-21 17:20:14,400 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 4367.7ms TimeCoverageRelationStatistics Valid=729, Invalid=3431, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:20:14,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-08-21 17:20:14,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 237. [2021-08-21 17:20:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 236 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:14,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 292 transitions. [2021-08-21 17:20:14,403 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 292 transitions. Word has length 120 [2021-08-21 17:20:14,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:20:14,403 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 292 transitions. [2021-08-21 17:20:14,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 292 transitions. [2021-08-21 17:20:14,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:20:14,404 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:20:14,404 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:20:14,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-08-21 17:20:14,404 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:20:14,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:20:14,404 INFO L82 PathProgramCache]: Analyzing trace with hash -597443349, now seen corresponding path program 60 times [2021-08-21 17:20:14,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:20:14,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873654685] [2021-08-21 17:20:14,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:20:14,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:20:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:20:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:20:15,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:20:15,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873654685] [2021-08-21 17:20:15,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873654685] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:20:15,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:20:15,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:20:15,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37327013] [2021-08-21 17:20:15,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:20:15,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:20:15,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:20:15,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:20:15,832 INFO L87 Difference]: Start difference. First operand 237 states and 292 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:20,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:20:20,130 INFO L93 Difference]: Finished difference Result 335 states and 422 transitions. [2021-08-21 17:20:20,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-21 17:20:20,130 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:20:20,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:20:20,131 INFO L225 Difference]: With dead ends: 335 [2021-08-21 17:20:20,131 INFO L226 Difference]: Without dead ends: 240 [2021-08-21 17:20:20,131 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 4290.5ms TimeCoverageRelationStatistics Valid=704, Invalid=3456, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:20:20,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-08-21 17:20:20,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 236. [2021-08-21 17:20:20,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.2340425531914894) internal successors, (290), 235 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:20,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 290 transitions. [2021-08-21 17:20:20,133 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 290 transitions. Word has length 120 [2021-08-21 17:20:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:20:20,133 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 290 transitions. [2021-08-21 17:20:20,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 290 transitions. [2021-08-21 17:20:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:20:20,134 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:20:20,134 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:20:20,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-08-21 17:20:20,134 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:20:20,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:20:20,135 INFO L82 PathProgramCache]: Analyzing trace with hash -720499343, now seen corresponding path program 61 times [2021-08-21 17:20:20,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:20:20,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83563424] [2021-08-21 17:20:20,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:20:20,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:20:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:20:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:20:21,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:20:21,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83563424] [2021-08-21 17:20:21,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83563424] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:20:21,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:20:21,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:20:21,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786860391] [2021-08-21 17:20:21,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:20:21,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:20:21,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:20:21,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:20:21,545 INFO L87 Difference]: Start difference. First operand 236 states and 290 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:20:26,023 INFO L93 Difference]: Finished difference Result 341 states and 430 transitions. [2021-08-21 17:20:26,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-21 17:20:26,023 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:20:26,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:20:26,023 INFO L225 Difference]: With dead ends: 341 [2021-08-21 17:20:26,023 INFO L226 Difference]: Without dead ends: 247 [2021-08-21 17:20:26,024 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 4502.7ms TimeCoverageRelationStatistics Valid=745, Invalid=3677, Unknown=0, NotChecked=0, Total=4422 [2021-08-21 17:20:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-08-21 17:20:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 238. [2021-08-21 17:20:26,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.2362869198312236) internal successors, (293), 237 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 293 transitions. [2021-08-21 17:20:26,026 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 293 transitions. Word has length 120 [2021-08-21 17:20:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:20:26,026 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 293 transitions. [2021-08-21 17:20:26,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 293 transitions. [2021-08-21 17:20:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:20:26,027 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:20:26,027 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:20:26,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-08-21 17:20:26,027 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:20:26,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:20:26,027 INFO L82 PathProgramCache]: Analyzing trace with hash -279867959, now seen corresponding path program 62 times [2021-08-21 17:20:26,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:20:26,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810606664] [2021-08-21 17:20:26,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:20:26,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:20:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:20:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:20:27,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:20:27,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810606664] [2021-08-21 17:20:27,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810606664] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:20:27,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:20:27,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:20:27,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198038488] [2021-08-21 17:20:27,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:20:27,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:20:27,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:20:27,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:20:27,168 INFO L87 Difference]: Start difference. First operand 238 states and 293 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:30,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:20:30,599 INFO L93 Difference]: Finished difference Result 337 states and 424 transitions. [2021-08-21 17:20:30,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-21 17:20:30,599 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:20:30,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:20:30,600 INFO L225 Difference]: With dead ends: 337 [2021-08-21 17:20:30,600 INFO L226 Difference]: Without dead ends: 238 [2021-08-21 17:20:30,600 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 3325.3ms TimeCoverageRelationStatistics Valid=683, Invalid=3477, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:20:30,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-08-21 17:20:30,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2021-08-21 17:20:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.2274678111587982) internal successors, (286), 233 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 286 transitions. [2021-08-21 17:20:30,602 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 286 transitions. Word has length 120 [2021-08-21 17:20:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:20:30,602 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 286 transitions. [2021-08-21 17:20:30,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:30,603 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 286 transitions. [2021-08-21 17:20:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:20:30,603 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:20:30,603 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:20:30,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-08-21 17:20:30,603 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:20:30,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:20:30,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1618767341, now seen corresponding path program 63 times [2021-08-21 17:20:30,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:20:30,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439177419] [2021-08-21 17:20:30,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:20:30,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:20:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:20:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:20:32,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:20:32,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439177419] [2021-08-21 17:20:32,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439177419] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:20:32,056 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:20:32,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:20:32,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110097357] [2021-08-21 17:20:32,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:20:32,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:20:32,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:20:32,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:20:32,057 INFO L87 Difference]: Start difference. First operand 234 states and 286 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:37,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:20:37,042 INFO L93 Difference]: Finished difference Result 341 states and 429 transitions. [2021-08-21 17:20:37,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-21 17:20:37,042 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:20:37,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:20:37,043 INFO L225 Difference]: With dead ends: 341 [2021-08-21 17:20:37,043 INFO L226 Difference]: Without dead ends: 247 [2021-08-21 17:20:37,043 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 4879.0ms TimeCoverageRelationStatistics Valid=771, Invalid=3785, Unknown=0, NotChecked=0, Total=4556 [2021-08-21 17:20:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-08-21 17:20:37,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 237. [2021-08-21 17:20:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.2330508474576272) internal successors, (291), 236 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:37,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 291 transitions. [2021-08-21 17:20:37,046 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 291 transitions. Word has length 120 [2021-08-21 17:20:37,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:20:37,046 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 291 transitions. [2021-08-21 17:20:37,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:37,046 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 291 transitions. [2021-08-21 17:20:37,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:20:37,047 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:20:37,047 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:20:37,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-08-21 17:20:37,047 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:20:37,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:20:37,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1178135957, now seen corresponding path program 64 times [2021-08-21 17:20:37,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:20:37,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726035763] [2021-08-21 17:20:37,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:20:37,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:20:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:20:38,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:20:38,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:20:38,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726035763] [2021-08-21 17:20:38,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726035763] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:20:38,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:20:38,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:20:38,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740297228] [2021-08-21 17:20:38,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:20:38,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:20:38,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:20:38,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:20:38,529 INFO L87 Difference]: Start difference. First operand 237 states and 291 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:20:42,356 INFO L93 Difference]: Finished difference Result 342 states and 429 transitions. [2021-08-21 17:20:42,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-21 17:20:42,357 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:20:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:20:42,357 INFO L225 Difference]: With dead ends: 342 [2021-08-21 17:20:42,357 INFO L226 Difference]: Without dead ends: 245 [2021-08-21 17:20:42,357 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 3890.6ms TimeCoverageRelationStatistics Valid=727, Invalid=3695, Unknown=0, NotChecked=0, Total=4422 [2021-08-21 17:20:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-08-21 17:20:42,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 235. [2021-08-21 17:20:42,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.2264957264957266) internal successors, (287), 234 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:42,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 287 transitions. [2021-08-21 17:20:42,359 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 287 transitions. Word has length 120 [2021-08-21 17:20:42,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:20:42,360 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 287 transitions. [2021-08-21 17:20:42,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:42,360 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 287 transitions. [2021-08-21 17:20:42,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:20:42,360 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:20:42,360 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:20:42,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-08-21 17:20:42,360 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:20:42,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:20:42,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1436240439, now seen corresponding path program 65 times [2021-08-21 17:20:42,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:20:42,361 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896685962] [2021-08-21 17:20:42,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:20:42,361 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:20:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:20:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:20:43,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:20:43,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896685962] [2021-08-21 17:20:43,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896685962] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:20:43,801 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:20:43,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:20:43,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794921377] [2021-08-21 17:20:43,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:20:43,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:20:43,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:20:43,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:20:43,802 INFO L87 Difference]: Start difference. First operand 235 states and 287 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:48,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:20:48,110 INFO L93 Difference]: Finished difference Result 335 states and 419 transitions. [2021-08-21 17:20:48,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-21 17:20:48,111 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:20:48,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:20:48,111 INFO L225 Difference]: With dead ends: 335 [2021-08-21 17:20:48,111 INFO L226 Difference]: Without dead ends: 237 [2021-08-21 17:20:48,112 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 4271.6ms TimeCoverageRelationStatistics Valid=666, Invalid=3494, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:20:48,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-08-21 17:20:48,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2021-08-21 17:20:48,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.2241379310344827) internal successors, (284), 232 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:48,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 284 transitions. [2021-08-21 17:20:48,114 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 284 transitions. Word has length 120 [2021-08-21 17:20:48,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:20:48,114 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 284 transitions. [2021-08-21 17:20:48,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:48,114 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 284 transitions. [2021-08-21 17:20:48,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:20:48,115 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:20:48,115 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:20:48,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-08-21 17:20:48,115 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:20:48,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:20:48,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1405805657, now seen corresponding path program 66 times [2021-08-21 17:20:48,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:20:48,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143651879] [2021-08-21 17:20:48,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:20:48,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:20:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:20:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:20:49,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:20:49,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143651879] [2021-08-21 17:20:49,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143651879] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:20:49,567 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:20:49,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:20:49,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895575611] [2021-08-21 17:20:49,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:20:49,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:20:49,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:20:49,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:20:49,568 INFO L87 Difference]: Start difference. First operand 233 states and 284 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:54,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:20:54,652 INFO L93 Difference]: Finished difference Result 336 states and 420 transitions. [2021-08-21 17:20:54,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-08-21 17:20:54,652 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:20:54,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:20:54,653 INFO L225 Difference]: With dead ends: 336 [2021-08-21 17:20:54,653 INFO L226 Difference]: Without dead ends: 242 [2021-08-21 17:20:54,653 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 5113.7ms TimeCoverageRelationStatistics Valid=800, Invalid=3892, Unknown=0, NotChecked=0, Total=4692 [2021-08-21 17:20:54,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-08-21 17:20:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 236. [2021-08-21 17:20:54,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.2297872340425533) internal successors, (289), 235 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 289 transitions. [2021-08-21 17:20:54,656 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 289 transitions. Word has length 120 [2021-08-21 17:20:54,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:20:54,656 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 289 transitions. [2021-08-21 17:20:54,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:20:54,656 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 289 transitions. [2021-08-21 17:20:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:20:54,656 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:20:54,656 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:20:54,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-08-21 17:20:54,657 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:20:54,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:20:54,657 INFO L82 PathProgramCache]: Analyzing trace with hash -965174273, now seen corresponding path program 67 times [2021-08-21 17:20:54,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:20:54,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959670759] [2021-08-21 17:20:54,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:20:54,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:20:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:20:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:20:56,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:20:56,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959670759] [2021-08-21 17:20:56,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959670759] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:20:56,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:20:56,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:20:56,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114125785] [2021-08-21 17:20:56,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:20:56,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:20:56,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:20:56,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:20:56,095 INFO L87 Difference]: Start difference. First operand 236 states and 289 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:00,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:21:00,120 INFO L93 Difference]: Finished difference Result 337 states and 420 transitions. [2021-08-21 17:21:00,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-21 17:21:00,120 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:21:00,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:21:00,121 INFO L225 Difference]: With dead ends: 337 [2021-08-21 17:21:00,121 INFO L226 Difference]: Without dead ends: 240 [2021-08-21 17:21:00,121 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 4166.5ms TimeCoverageRelationStatistics Valid=755, Invalid=3801, Unknown=0, NotChecked=0, Total=4556 [2021-08-21 17:21:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-08-21 17:21:00,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 234. [2021-08-21 17:21:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.2231759656652361) internal successors, (285), 233 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 285 transitions. [2021-08-21 17:21:00,124 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 285 transitions. Word has length 120 [2021-08-21 17:21:00,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:21:00,124 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 285 transitions. [2021-08-21 17:21:00,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 285 transitions. [2021-08-21 17:21:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:21:00,125 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:21:00,126 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:21:00,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-08-21 17:21:00,126 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:21:00,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:21:00,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1223278755, now seen corresponding path program 68 times [2021-08-21 17:21:00,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:21:00,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148701926] [2021-08-21 17:21:00,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:21:00,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:21:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:21:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:21:01,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:21:01,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148701926] [2021-08-21 17:21:01,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148701926] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:21:01,520 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:21:01,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:21:01,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624961877] [2021-08-21 17:21:01,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:21:01,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:21:01,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:21:01,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:21:01,521 INFO L87 Difference]: Start difference. First operand 234 states and 285 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:05,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:21:05,995 INFO L93 Difference]: Finished difference Result 336 states and 417 transitions. [2021-08-21 17:21:05,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-21 17:21:05,996 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:21:05,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:21:05,996 INFO L225 Difference]: With dead ends: 336 [2021-08-21 17:21:05,996 INFO L226 Difference]: Without dead ends: 239 [2021-08-21 17:21:05,997 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 4446.5ms TimeCoverageRelationStatistics Valid=713, Invalid=3709, Unknown=0, NotChecked=0, Total=4422 [2021-08-21 17:21:05,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-08-21 17:21:05,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2021-08-21 17:21:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.2198275862068966) internal successors, (283), 232 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 283 transitions. [2021-08-21 17:21:05,999 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 283 transitions. Word has length 120 [2021-08-21 17:21:05,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:21:05,999 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 283 transitions. [2021-08-21 17:21:05,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:05,999 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 283 transitions. [2021-08-21 17:21:05,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:21:05,999 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:21:05,999 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:21:05,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-08-21 17:21:05,999 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:21:06,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:21:06,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1512084245, now seen corresponding path program 69 times [2021-08-21 17:21:06,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:21:06,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369991112] [2021-08-21 17:21:06,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:21:06,005 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:21:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:21:07,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:21:07,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:21:07,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369991112] [2021-08-21 17:21:07,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369991112] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:21:07,471 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:21:07,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:21:07,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325352366] [2021-08-21 17:21:07,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:21:07,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:21:07,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:21:07,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:21:07,472 INFO L87 Difference]: Start difference. First operand 233 states and 283 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:21:11,768 INFO L93 Difference]: Finished difference Result 329 states and 408 transitions. [2021-08-21 17:21:11,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-21 17:21:11,769 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:21:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:21:11,769 INFO L225 Difference]: With dead ends: 329 [2021-08-21 17:21:11,769 INFO L226 Difference]: Without dead ends: 223 [2021-08-21 17:21:11,770 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 4286.0ms TimeCoverageRelationStatistics Valid=675, Invalid=3615, Unknown=0, NotChecked=0, Total=4290 [2021-08-21 17:21:11,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-08-21 17:21:11,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2021-08-21 17:21:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.2252252252252251) internal successors, (272), 222 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:11,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 272 transitions. [2021-08-21 17:21:11,772 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 272 transitions. Word has length 120 [2021-08-21 17:21:11,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:21:11,772 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 272 transitions. [2021-08-21 17:21:11,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:11,772 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 272 transitions. [2021-08-21 17:21:11,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:21:11,772 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:21:11,772 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:21:11,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-08-21 17:21:11,772 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:21:11,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:21:11,773 INFO L82 PathProgramCache]: Analyzing trace with hash 67148311, now seen corresponding path program 70 times [2021-08-21 17:21:11,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:21:11,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972141323] [2021-08-21 17:21:11,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:21:11,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:21:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:21:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:21:13,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:21:13,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972141323] [2021-08-21 17:21:13,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972141323] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:21:13,430 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:21:13,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:21:13,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637390615] [2021-08-21 17:21:13,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:21:13,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:21:13,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:21:13,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:21:13,431 INFO L87 Difference]: Start difference. First operand 223 states and 272 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:21:17,963 INFO L93 Difference]: Finished difference Result 338 states and 425 transitions. [2021-08-21 17:21:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-21 17:21:17,964 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:21:17,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:21:17,964 INFO L225 Difference]: With dead ends: 338 [2021-08-21 17:21:17,964 INFO L226 Difference]: Without dead ends: 239 [2021-08-21 17:21:17,964 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 4576.1ms TimeCoverageRelationStatistics Valid=791, Invalid=3765, Unknown=0, NotChecked=0, Total=4556 [2021-08-21 17:21:17,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-08-21 17:21:17,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 215. [2021-08-21 17:21:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.205607476635514) internal successors, (258), 214 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 258 transitions. [2021-08-21 17:21:17,966 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 258 transitions. Word has length 120 [2021-08-21 17:21:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:21:17,967 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 258 transitions. [2021-08-21 17:21:17,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:17,967 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 258 transitions. [2021-08-21 17:21:17,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:21:17,967 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:21:17,967 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:21:17,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-08-21 17:21:17,967 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:21:17,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:21:17,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1377690583, now seen corresponding path program 71 times [2021-08-21 17:21:17,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:21:17,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937063076] [2021-08-21 17:21:17,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:21:17,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:21:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:21:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:21:19,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:21:19,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937063076] [2021-08-21 17:21:19,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937063076] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:21:19,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:21:19,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:21:19,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249511270] [2021-08-21 17:21:19,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:21:19,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:21:19,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:21:19,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:21:19,439 INFO L87 Difference]: Start difference. First operand 215 states and 258 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:24,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:21:24,407 INFO L93 Difference]: Finished difference Result 327 states and 409 transitions. [2021-08-21 17:21:24,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-21 17:21:24,408 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:21:24,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:21:24,408 INFO L225 Difference]: With dead ends: 327 [2021-08-21 17:21:24,408 INFO L226 Difference]: Without dead ends: 231 [2021-08-21 17:21:24,408 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 4794.3ms TimeCoverageRelationStatistics Valid=767, Invalid=3655, Unknown=0, NotChecked=0, Total=4422 [2021-08-21 17:21:24,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-08-21 17:21:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 217. [2021-08-21 17:21:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.212962962962963) internal successors, (262), 216 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 262 transitions. [2021-08-21 17:21:24,410 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 262 transitions. Word has length 120 [2021-08-21 17:21:24,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:21:24,410 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 262 transitions. [2021-08-21 17:21:24,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 262 transitions. [2021-08-21 17:21:24,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:21:24,411 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:21:24,411 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:21:24,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-08-21 17:21:24,411 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:21:24,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:21:24,412 INFO L82 PathProgramCache]: Analyzing trace with hash -473447001, now seen corresponding path program 72 times [2021-08-21 17:21:24,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:21:24,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229223780] [2021-08-21 17:21:24,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:21:24,412 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:21:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:21:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:21:25,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:21:25,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229223780] [2021-08-21 17:21:25,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229223780] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:21:25,938 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:21:25,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:21:25,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760727885] [2021-08-21 17:21:25,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:21:25,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:21:25,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:21:25,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:21:25,939 INFO L87 Difference]: Start difference. First operand 217 states and 262 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:30,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:21:30,026 INFO L93 Difference]: Finished difference Result 317 states and 395 transitions. [2021-08-21 17:21:30,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-21 17:21:30,026 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:21:30,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:21:30,027 INFO L225 Difference]: With dead ends: 317 [2021-08-21 17:21:30,027 INFO L226 Difference]: Without dead ends: 221 [2021-08-21 17:21:30,027 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 4199.2ms TimeCoverageRelationStatistics Valid=729, Invalid=3431, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:21:30,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-08-21 17:21:30,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2021-08-21 17:21:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.2119815668202765) internal successors, (263), 217 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:30,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 263 transitions. [2021-08-21 17:21:30,030 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 263 transitions. Word has length 120 [2021-08-21 17:21:30,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:21:30,030 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 263 transitions. [2021-08-21 17:21:30,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:30,030 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 263 transitions. [2021-08-21 17:21:30,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:21:30,031 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:21:30,031 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:21:30,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-08-21 17:21:30,031 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:21:30,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:21:30,031 INFO L82 PathProgramCache]: Analyzing trace with hash 534018659, now seen corresponding path program 73 times [2021-08-21 17:21:30,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:21:30,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835682126] [2021-08-21 17:21:30,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:21:30,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:21:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:21:31,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:21:31,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:21:31,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835682126] [2021-08-21 17:21:31,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835682126] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:21:31,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:21:31,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:21:31,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989069904] [2021-08-21 17:21:31,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:21:31,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:21:31,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:21:31,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:21:31,266 INFO L87 Difference]: Start difference. First operand 218 states and 263 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:35,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:21:35,191 INFO L93 Difference]: Finished difference Result 315 states and 391 transitions. [2021-08-21 17:21:35,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-21 17:21:35,191 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:21:35,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:21:35,192 INFO L225 Difference]: With dead ends: 315 [2021-08-21 17:21:35,192 INFO L226 Difference]: Without dead ends: 220 [2021-08-21 17:21:35,192 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 3875.7ms TimeCoverageRelationStatistics Valid=704, Invalid=3456, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:21:35,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-08-21 17:21:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2021-08-21 17:21:35,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.2083333333333333) internal successors, (261), 216 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 261 transitions. [2021-08-21 17:21:35,194 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 261 transitions. Word has length 120 [2021-08-21 17:21:35,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:21:35,194 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 261 transitions. [2021-08-21 17:21:35,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:35,194 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 261 transitions. [2021-08-21 17:21:35,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:21:35,195 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:21:35,195 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:21:35,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-08-21 17:21:35,195 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:21:35,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:21:35,195 INFO L82 PathProgramCache]: Analyzing trace with hash 410962665, now seen corresponding path program 74 times [2021-08-21 17:21:35,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:21:35,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731116914] [2021-08-21 17:21:35,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:21:35,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:21:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:21:36,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:21:36,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:21:36,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731116914] [2021-08-21 17:21:36,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731116914] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:21:36,286 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:21:36,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:21:36,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018360870] [2021-08-21 17:21:36,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:21:36,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:21:36,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:21:36,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:21:36,287 INFO L87 Difference]: Start difference. First operand 217 states and 261 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:40,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:21:40,584 INFO L93 Difference]: Finished difference Result 321 states and 399 transitions. [2021-08-21 17:21:40,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-21 17:21:40,584 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:21:40,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:21:40,585 INFO L225 Difference]: With dead ends: 321 [2021-08-21 17:21:40,585 INFO L226 Difference]: Without dead ends: 227 [2021-08-21 17:21:40,585 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 4099.2ms TimeCoverageRelationStatistics Valid=745, Invalid=3677, Unknown=0, NotChecked=0, Total=4422 [2021-08-21 17:21:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-08-21 17:21:40,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 219. [2021-08-21 17:21:40,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.2110091743119267) internal successors, (264), 218 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 264 transitions. [2021-08-21 17:21:40,587 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 264 transitions. Word has length 120 [2021-08-21 17:21:40,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:21:40,587 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 264 transitions. [2021-08-21 17:21:40,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:40,587 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 264 transitions. [2021-08-21 17:21:40,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:21:40,588 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:21:40,588 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:21:40,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-08-21 17:21:40,588 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:21:40,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:21:40,588 INFO L82 PathProgramCache]: Analyzing trace with hash 851594049, now seen corresponding path program 75 times [2021-08-21 17:21:40,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:21:40,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499810510] [2021-08-21 17:21:40,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:21:40,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:21:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:21:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:21:41,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:21:41,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499810510] [2021-08-21 17:21:41,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499810510] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:21:41,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:21:41,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:21:41,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103789277] [2021-08-21 17:21:41,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:21:41,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:21:41,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:21:41,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:21:41,964 INFO L87 Difference]: Start difference. First operand 219 states and 264 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:45,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:21:45,848 INFO L93 Difference]: Finished difference Result 317 states and 393 transitions. [2021-08-21 17:21:45,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-21 17:21:45,848 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:21:45,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:21:45,848 INFO L225 Difference]: With dead ends: 317 [2021-08-21 17:21:45,848 INFO L226 Difference]: Without dead ends: 218 [2021-08-21 17:21:45,849 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 3943.1ms TimeCoverageRelationStatistics Valid=683, Invalid=3477, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:21:45,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-08-21 17:21:45,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 215. [2021-08-21 17:21:45,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.2009345794392523) internal successors, (257), 214 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:45,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 257 transitions. [2021-08-21 17:21:45,851 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 257 transitions. Word has length 120 [2021-08-21 17:21:45,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:21:45,851 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 257 transitions. [2021-08-21 17:21:45,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:45,851 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 257 transitions. [2021-08-21 17:21:45,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:21:45,852 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:21:45,852 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:21:45,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-08-21 17:21:45,852 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:21:45,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:21:45,852 INFO L82 PathProgramCache]: Analyzing trace with hash -487305333, now seen corresponding path program 76 times [2021-08-21 17:21:45,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:21:45,852 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116354129] [2021-08-21 17:21:45,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:21:45,853 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:21:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:21:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:21:47,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:21:47,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116354129] [2021-08-21 17:21:47,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116354129] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:21:47,239 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:21:47,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:21:47,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804832743] [2021-08-21 17:21:47,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:21:47,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:21:47,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:21:47,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:21:47,240 INFO L87 Difference]: Start difference. First operand 215 states and 257 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:21:52,010 INFO L93 Difference]: Finished difference Result 316 states and 390 transitions. [2021-08-21 17:21:52,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-21 17:21:52,011 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:21:52,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:21:52,011 INFO L225 Difference]: With dead ends: 316 [2021-08-21 17:21:52,011 INFO L226 Difference]: Without dead ends: 222 [2021-08-21 17:21:52,011 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 4735.9ms TimeCoverageRelationStatistics Valid=771, Invalid=3785, Unknown=0, NotChecked=0, Total=4556 [2021-08-21 17:21:52,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-08-21 17:21:52,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 217. [2021-08-21 17:21:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.2037037037037037) internal successors, (260), 216 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 260 transitions. [2021-08-21 17:21:52,013 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 260 transitions. Word has length 120 [2021-08-21 17:21:52,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:21:52,013 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 260 transitions. [2021-08-21 17:21:52,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:52,014 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 260 transitions. [2021-08-21 17:21:52,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:21:52,014 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:21:52,014 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:21:52,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-08-21 17:21:52,014 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:21:52,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:21:52,014 INFO L82 PathProgramCache]: Analyzing trace with hash -46673949, now seen corresponding path program 77 times [2021-08-21 17:21:52,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:21:52,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486719143] [2021-08-21 17:21:52,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:21:52,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:21:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:21:53,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:21:53,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:21:53,318 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486719143] [2021-08-21 17:21:53,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486719143] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:21:53,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:21:53,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:21:53,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631806524] [2021-08-21 17:21:53,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:21:53,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:21:53,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:21:53,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:21:53,319 INFO L87 Difference]: Start difference. First operand 217 states and 260 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:57,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:21:57,743 INFO L93 Difference]: Finished difference Result 317 states and 390 transitions. [2021-08-21 17:21:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-21 17:21:57,744 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:21:57,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:21:57,744 INFO L225 Difference]: With dead ends: 317 [2021-08-21 17:21:57,744 INFO L226 Difference]: Without dead ends: 220 [2021-08-21 17:21:57,744 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 4348.0ms TimeCoverageRelationStatistics Valid=727, Invalid=3695, Unknown=0, NotChecked=0, Total=4422 [2021-08-21 17:21:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-08-21 17:21:57,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 215. [2021-08-21 17:21:57,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.1962616822429906) internal successors, (256), 214 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:57,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 256 transitions. [2021-08-21 17:21:57,746 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 256 transitions. Word has length 120 [2021-08-21 17:21:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:21:57,746 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 256 transitions. [2021-08-21 17:21:57,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:21:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 256 transitions. [2021-08-21 17:21:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:21:57,747 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:21:57,747 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:21:57,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-08-21 17:21:57,747 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:21:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:21:57,747 INFO L82 PathProgramCache]: Analyzing trace with hash -304778431, now seen corresponding path program 78 times [2021-08-21 17:21:57,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:21:57,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55563276] [2021-08-21 17:21:57,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:21:57,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:21:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:21:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:21:59,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:21:59,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55563276] [2021-08-21 17:21:59,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55563276] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:21:59,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:21:59,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:21:59,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008722390] [2021-08-21 17:21:59,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:21:59,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:21:59,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:21:59,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:21:59,100 INFO L87 Difference]: Start difference. First operand 215 states and 256 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:03,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:22:03,283 INFO L93 Difference]: Finished difference Result 310 states and 380 transitions. [2021-08-21 17:22:03,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-21 17:22:03,284 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:22:03,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:22:03,284 INFO L225 Difference]: With dead ends: 310 [2021-08-21 17:22:03,284 INFO L226 Difference]: Without dead ends: 205 [2021-08-21 17:22:03,285 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 4195.3ms TimeCoverageRelationStatistics Valid=687, Invalid=3603, Unknown=0, NotChecked=0, Total=4290 [2021-08-21 17:22:03,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-08-21 17:22:03,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2021-08-21 17:22:03,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.2009803921568627) internal successors, (245), 204 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 245 transitions. [2021-08-21 17:22:03,286 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 245 transitions. Word has length 120 [2021-08-21 17:22:03,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:22:03,286 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 245 transitions. [2021-08-21 17:22:03,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:03,287 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 245 transitions. [2021-08-21 17:22:03,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:22:03,287 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:22:03,287 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:22:03,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-08-21 17:22:03,287 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:22:03,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:22:03,294 INFO L82 PathProgramCache]: Analyzing trace with hash 363677279, now seen corresponding path program 79 times [2021-08-21 17:22:03,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:22:03,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211240255] [2021-08-21 17:22:03,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:22:03,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:22:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:22:05,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:22:05,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:22:05,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211240255] [2021-08-21 17:22:05,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211240255] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:22:05,186 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:22:05,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:22:05,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784338273] [2021-08-21 17:22:05,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:22:05,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:22:05,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:22:05,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:22:05,187 INFO L87 Difference]: Start difference. First operand 205 states and 245 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:09,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:22:09,359 INFO L93 Difference]: Finished difference Result 309 states and 381 transitions. [2021-08-21 17:22:09,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-21 17:22:09,359 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:22:09,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:22:09,360 INFO L225 Difference]: With dead ends: 309 [2021-08-21 17:22:09,360 INFO L226 Difference]: Without dead ends: 213 [2021-08-21 17:22:09,360 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 4402.7ms TimeCoverageRelationStatistics Valid=767, Invalid=3655, Unknown=0, NotChecked=0, Total=4422 [2021-08-21 17:22:09,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-08-21 17:22:09,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 201. [2021-08-21 17:22:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.19) internal successors, (238), 200 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 238 transitions. [2021-08-21 17:22:09,362 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 238 transitions. Word has length 120 [2021-08-21 17:22:09,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:22:09,362 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 238 transitions. [2021-08-21 17:22:09,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 238 transitions. [2021-08-21 17:22:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:22:09,363 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:22:09,363 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:22:09,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-08-21 17:22:09,363 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:22:09,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:22:09,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1487460305, now seen corresponding path program 80 times [2021-08-21 17:22:09,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:22:09,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350760773] [2021-08-21 17:22:09,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:22:09,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:22:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:22:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:22:10,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:22:10,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350760773] [2021-08-21 17:22:10,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350760773] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:22:10,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:22:10,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:22:10,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470667097] [2021-08-21 17:22:10,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:22:10,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:22:10,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:22:10,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:22:10,634 INFO L87 Difference]: Start difference. First operand 201 states and 238 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:22:14,197 INFO L93 Difference]: Finished difference Result 299 states and 367 transitions. [2021-08-21 17:22:14,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-21 17:22:14,198 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:22:14,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:22:14,198 INFO L225 Difference]: With dead ends: 299 [2021-08-21 17:22:14,198 INFO L226 Difference]: Without dead ends: 203 [2021-08-21 17:22:14,198 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 3577.6ms TimeCoverageRelationStatistics Valid=729, Invalid=3431, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:22:14,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-08-21 17:22:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2021-08-21 17:22:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.1890547263681592) internal successors, (239), 201 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 239 transitions. [2021-08-21 17:22:14,200 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 239 transitions. Word has length 120 [2021-08-21 17:22:14,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:22:14,200 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 239 transitions. [2021-08-21 17:22:14,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:14,200 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 239 transitions. [2021-08-21 17:22:14,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:22:14,201 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:22:14,201 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:22:14,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-08-21 17:22:14,201 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:22:14,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:22:14,201 INFO L82 PathProgramCache]: Analyzing trace with hash -479994645, now seen corresponding path program 81 times [2021-08-21 17:22:14,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:22:14,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227889494] [2021-08-21 17:22:14,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:22:14,202 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:22:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:22:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:22:15,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:22:15,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227889494] [2021-08-21 17:22:15,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227889494] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:22:15,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:22:15,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:22:15,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457645672] [2021-08-21 17:22:15,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:22:15,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:22:15,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:22:15,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:22:15,965 INFO L87 Difference]: Start difference. First operand 202 states and 239 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:22:20,790 INFO L93 Difference]: Finished difference Result 297 states and 363 transitions. [2021-08-21 17:22:20,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-21 17:22:20,791 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:22:20,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:22:20,791 INFO L225 Difference]: With dead ends: 297 [2021-08-21 17:22:20,791 INFO L226 Difference]: Without dead ends: 202 [2021-08-21 17:22:20,791 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 4864.2ms TimeCoverageRelationStatistics Valid=704, Invalid=3456, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:22:20,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-08-21 17:22:20,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2021-08-21 17:22:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.185) internal successors, (237), 200 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 237 transitions. [2021-08-21 17:22:20,793 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 237 transitions. Word has length 120 [2021-08-21 17:22:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:22:20,793 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 237 transitions. [2021-08-21 17:22:20,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 237 transitions. [2021-08-21 17:22:20,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:22:20,794 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:22:20,794 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:22:20,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-08-21 17:22:20,794 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:22:20,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:22:20,794 INFO L82 PathProgramCache]: Analyzing trace with hash -603050639, now seen corresponding path program 82 times [2021-08-21 17:22:20,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:22:20,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557203347] [2021-08-21 17:22:20,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:22:20,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:22:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:22:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:22:22,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:22:22,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557203347] [2021-08-21 17:22:22,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557203347] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:22:22,530 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:22:22,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:22:22,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302035918] [2021-08-21 17:22:22,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:22:22,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:22:22,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:22:22,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:22:22,531 INFO L87 Difference]: Start difference. First operand 201 states and 237 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:22:27,724 INFO L93 Difference]: Finished difference Result 298 states and 364 transitions. [2021-08-21 17:22:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-21 17:22:27,725 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:22:27,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:22:27,725 INFO L225 Difference]: With dead ends: 298 [2021-08-21 17:22:27,725 INFO L226 Difference]: Without dead ends: 204 [2021-08-21 17:22:27,725 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 5207.1ms TimeCoverageRelationStatistics Valid=745, Invalid=3677, Unknown=0, NotChecked=0, Total=4422 [2021-08-21 17:22:27,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-08-21 17:22:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2021-08-21 17:22:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.18) internal successors, (236), 200 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 236 transitions. [2021-08-21 17:22:27,727 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 236 transitions. Word has length 120 [2021-08-21 17:22:27,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:22:27,727 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 236 transitions. [2021-08-21 17:22:27,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:27,728 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 236 transitions. [2021-08-21 17:22:27,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:22:27,728 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:22:27,728 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:22:27,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-08-21 17:22:27,728 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:22:27,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:22:27,728 INFO L82 PathProgramCache]: Analyzing trace with hash -162419255, now seen corresponding path program 83 times [2021-08-21 17:22:27,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:22:27,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916280528] [2021-08-21 17:22:27,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:22:27,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:22:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:22:29,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:22:29,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:22:29,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916280528] [2021-08-21 17:22:29,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916280528] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:22:29,330 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:22:29,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:22:29,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471510295] [2021-08-21 17:22:29,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:22:29,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:22:29,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:22:29,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:22:29,331 INFO L87 Difference]: Start difference. First operand 201 states and 236 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:34,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:22:34,030 INFO L93 Difference]: Finished difference Result 294 states and 358 transitions. [2021-08-21 17:22:34,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-21 17:22:34,031 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:22:34,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:22:34,031 INFO L225 Difference]: With dead ends: 294 [2021-08-21 17:22:34,031 INFO L226 Difference]: Without dead ends: 181 [2021-08-21 17:22:34,032 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 4688.2ms TimeCoverageRelationStatistics Valid=703, Invalid=3587, Unknown=0, NotChecked=0, Total=4290 [2021-08-21 17:22:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-08-21 17:22:34,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-08-21 17:22:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.1777777777777778) internal successors, (212), 180 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 212 transitions. [2021-08-21 17:22:34,033 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 212 transitions. Word has length 120 [2021-08-21 17:22:34,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:22:34,033 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 212 transitions. [2021-08-21 17:22:34,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:34,034 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 212 transitions. [2021-08-21 17:22:34,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:22:34,034 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:22:34,034 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:22:34,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-08-21 17:22:34,034 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:22:34,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:22:34,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1782253615, now seen corresponding path program 84 times [2021-08-21 17:22:34,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:22:34,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062697231] [2021-08-21 17:22:34,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:22:34,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:22:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:22:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:22:35,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:22:35,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062697231] [2021-08-21 17:22:35,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062697231] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:22:35,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:22:35,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:22:35,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865768936] [2021-08-21 17:22:35,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:22:35,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:22:35,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:22:35,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:22:35,415 INFO L87 Difference]: Start difference. First operand 181 states and 212 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:40,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:22:40,168 INFO L93 Difference]: Finished difference Result 273 states and 333 transitions. [2021-08-21 17:22:40,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-21 17:22:40,168 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:22:40,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:22:40,168 INFO L225 Difference]: With dead ends: 273 [2021-08-21 17:22:40,168 INFO L226 Difference]: Without dead ends: 177 [2021-08-21 17:22:40,169 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 4706.0ms TimeCoverageRelationStatistics Valid=729, Invalid=3431, Unknown=0, NotChecked=0, Total=4160 [2021-08-21 17:22:40,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-08-21 17:22:40,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-08-21 17:22:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.1704545454545454) internal successors, (206), 176 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:40,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 206 transitions. [2021-08-21 17:22:40,192 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 206 transitions. Word has length 120 [2021-08-21 17:22:40,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:22:40,192 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 206 transitions. [2021-08-21 17:22:40,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:40,192 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 206 transitions. [2021-08-21 17:22:40,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-21 17:22:40,192 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:22:40,192 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:22:40,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-08-21 17:22:40,193 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-21 17:22:40,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:22:40,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1505248021, now seen corresponding path program 85 times [2021-08-21 17:22:40,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:22:40,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576241917] [2021-08-21 17:22:40,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:22:40,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:22:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:22:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:22:41,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:22:41,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576241917] [2021-08-21 17:22:41,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576241917] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:22:41,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:22:41,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-08-21 17:22:41,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140997345] [2021-08-21 17:22:41,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-21 17:22:41,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:22:41,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-21 17:22:41,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2021-08-21 17:22:41,583 INFO L87 Difference]: Start difference. First operand 177 states and 206 transitions. Second operand has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:45,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:22:45,635 INFO L93 Difference]: Finished difference Result 175 states and 204 transitions. [2021-08-21 17:22:45,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-08-21 17:22:45,635 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2021-08-21 17:22:45,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:22:45,635 INFO L225 Difference]: With dead ends: 175 [2021-08-21 17:22:45,635 INFO L226 Difference]: Without dead ends: 0 [2021-08-21 17:22:45,636 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 4178.7ms TimeCoverageRelationStatistics Valid=673, Invalid=3359, Unknown=0, NotChecked=0, Total=4032 [2021-08-21 17:22:45,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-21 17:22:45,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-21 17:22:45,636 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) [2021-08-21 17:22:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-21 17:22:45,636 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2021-08-21 17:22:45,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:22:45,636 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-21 17:22:45,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 35 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:22:45,637 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-21 17:22:45,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-21 17:22:45,638 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:22:45,639 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:22:45,639 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:22:45,639 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:22:45,639 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:22:45,639 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:22:45,639 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-21 17:22:45,639 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-21 17:22:45,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-08-21 17:22:45,642 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-21 17:22:45,642 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-21 17:22:45,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 05:22:45 BasicIcfg [2021-08-21 17:22:45,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-21 17:22:45,644 INFO L168 Benchmark]: Toolchain (without parser) took 591018.32 ms. Allocated memory was 188.7 MB in the beginning and 879.8 MB in the end (delta: 691.0 MB). Free memory was 170.6 MB in the beginning and 437.1 MB in the end (delta: -266.6 MB). Peak memory consumption was 424.0 MB. Max. memory is 8.0 GB. [2021-08-21 17:22:45,644 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 188.7 MB. Free memory was 169.4 MB in the beginning and 169.4 MB in the end (delta: 88.0 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-21 17:22:45,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 786.87 ms. Allocated memory is still 188.7 MB. Free memory was 170.6 MB in the beginning and 129.4 MB in the end (delta: 41.2 MB). Peak memory consumption was 40.9 MB. Max. memory is 8.0 GB. [2021-08-21 17:22:45,644 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.78 ms. Allocated memory is still 188.7 MB. Free memory was 129.4 MB in the beginning and 167.8 MB in the end (delta: -38.4 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2021-08-21 17:22:45,644 INFO L168 Benchmark]: Boogie Preprocessor took 25.18 ms. Allocated memory is still 188.7 MB. Free memory was 167.8 MB in the beginning and 165.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-21 17:22:45,645 INFO L168 Benchmark]: RCFGBuilder took 521.67 ms. Allocated memory is still 188.7 MB. Free memory was 165.1 MB in the beginning and 117.5 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.2 MB. Max. memory is 8.0 GB. [2021-08-21 17:22:45,645 INFO L168 Benchmark]: TraceAbstraction took 589623.00 ms. Allocated memory was 188.7 MB in the beginning and 879.8 MB in the end (delta: 691.0 MB). Free memory was 116.9 MB in the beginning and 437.1 MB in the end (delta: -320.2 MB). Peak memory consumption was 370.3 MB. Max. memory is 8.0 GB. [2021-08-21 17:22:45,645 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.20 ms. Allocated memory is still 188.7 MB. Free memory was 169.4 MB in the beginning and 169.4 MB in the end (delta: 88.0 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 786.87 ms. Allocated memory is still 188.7 MB. Free memory was 170.6 MB in the beginning and 129.4 MB in the end (delta: 41.2 MB). Peak memory consumption was 40.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 57.78 ms. Allocated memory is still 188.7 MB. Free memory was 129.4 MB in the beginning and 167.8 MB in the end (delta: -38.4 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 25.18 ms. Allocated memory is still 188.7 MB. Free memory was 167.8 MB in the beginning and 165.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 521.67 ms. Allocated memory is still 188.7 MB. Free memory was 165.1 MB in the beginning and 117.5 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 589623.00 ms. Allocated memory was 188.7 MB in the beginning and 879.8 MB in the end (delta: 691.0 MB). Free memory was 116.9 MB in the beginning and 437.1 MB in the end (delta: -320.2 MB). Peak memory consumption was 370.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 19616, positive: 18744, positive conditional: 18744, positive unconditional: 0, negative: 872, negative conditional: 872, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19392, positive: 18744, positive conditional: 0, positive unconditional: 18744, negative: 648, negative conditional: 0, negative unconditional: 648, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1716, positive: 1672, positive conditional: 0, positive unconditional: 1672, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1716, positive: 1670, positive conditional: 0, positive unconditional: 1670, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60116, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1340, negative conditional: 0, negative unconditional: 1340, unknown: 58772, unknown conditional: 0, unknown unconditional: 58772] ], Cache Queries: [ total: 19392, positive: 17072, positive conditional: 0, positive unconditional: 17072, negative: 604, negative conditional: 0, negative unconditional: 604, unknown: 1716, unknown conditional: 0, unknown unconditional: 1716] , Statistics on independence cache: Total cache size (in pairs): 1716, Positive cache size: 1672, Positive conditional cache size: 0, Positive unconditional cache size: 1672, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Independence queries for same thread: 224 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: 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 with 1 thread instances CFG has 4 procedures, 178 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 589539.2ms, OverallIterations: 99, TraceHistogramMax: 1, EmptinessCheckTime: 121.2ms, AutomataDifference: 395528.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 60636.8ms, PartialOrderReductionTime: 60625.2ms, HoareTripleCheckerStatistics: 11415 SDtfs, 99654 SDslu, 182067 SDs, 0 SdLazy, 127270 SolverSat, 9739 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 66505.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6458 GetRequests, 313 SyntacticMatches, 200 SemanticMatches, 5945 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62703 ImplicationChecksByTransitivity, 386362.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9274occurred in iteration=0, InterpolantAutomatonStates: 3448, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 762.7ms AutomataMinimizationTime, 99 MinimizatonAttempts, 5269 StatesRemovedByMinimization, 82 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 207.3ms SsaConstructionTime, 2073.6ms SatisfiabilityAnalysisTime, 128876.4ms InterpolantComputationTime, 11510 NumberOfCodeBlocks, 11510 NumberOfCodeBlocksAsserted, 99 NumberOfCheckSat, 11411 ConstructedInterpolants, 0 QuantifiedInterpolants, 266566 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 99 InterpolantComputations, 99 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-08-21 17:22:45,745 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...