./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_14-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8922609e-4515-4067-ac34-4133acc5ebe0/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8922609e-4515-4067-ac34-4133acc5ebe0/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8922609e-4515-4067-ac34-4133acc5ebe0/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8922609e-4515-4067-ac34-4133acc5ebe0/bin/uautomizer-IVEQpCNsaX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_14-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8922609e-4515-4067-ac34-4133acc5ebe0/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8922609e-4515-4067-ac34-4133acc5ebe0/bin/uautomizer-IVEQpCNsaX --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 10:50:49,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 10:50:49,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 10:50:49,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 10:50:49,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 10:50:49,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 10:50:49,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 10:50:49,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 10:50:49,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 10:50:49,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 10:50:49,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 10:50:49,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 10:50:49,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 10:50:49,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 10:50:49,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 10:50:49,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 10:50:49,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 10:50:49,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 10:50:49,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 10:50:49,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 10:50:49,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 10:50:49,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 10:50:49,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 10:50:49,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 10:50:49,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 10:50:49,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 10:50:49,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 10:50:49,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 10:50:49,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 10:50:49,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 10:50:49,704 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 10:50:49,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 10:50:49,706 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 10:50:49,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 10:50:49,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 10:50:49,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 10:50:49,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 10:50:49,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 10:50:49,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 10:50:49,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 10:50:49,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 10:50:49,716 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8922609e-4515-4067-ac34-4133acc5ebe0/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-09 10:50:49,748 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 10:50:49,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 10:50:49,749 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 10:50:49,749 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 10:50:49,750 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 10:50:49,751 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 10:50:49,751 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 10:50:49,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 10:50:49,751 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 10:50:49,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 10:50:49,752 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 10:50:49,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 10:50:49,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-09 10:50:49,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-09 10:50:49,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-09 10:50:49,753 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 10:50:49,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 10:50:49,753 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 10:50:49,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-09 10:50:49,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 10:50:49,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 10:50:49,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-09 10:50:49,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 10:50:49,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 10:50:49,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-09 10:50:49,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-09 10:50:49,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 10:50:49,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-09 10:50:49,755 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-09 10:50:49,755 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-09 10:50:49,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-09 10:50:49,756 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 10:50:49,756 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8922609e-4515-4067-ac34-4133acc5ebe0/bin/uautomizer-IVEQpCNsaX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8922609e-4515-4067-ac34-4133acc5ebe0/bin/uautomizer-IVEQpCNsaX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd [2021-11-09 10:50:50,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 10:50:50,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 10:50:50,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 10:50:50,150 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 10:50:50,151 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 10:50:50,152 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8922609e-4515-4067-ac34-4133acc5ebe0/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/locks/test_locks_14-1.c [2021-11-09 10:50:50,248 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8922609e-4515-4067-ac34-4133acc5ebe0/bin/uautomizer-IVEQpCNsaX/data/89934f6ef/c2d3d10c72914fcd98fd745e1f41a6cd/FLAGb6f205899 [2021-11-09 10:50:50,723 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 10:50:50,723 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8922609e-4515-4067-ac34-4133acc5ebe0/sv-benchmarks/c/locks/test_locks_14-1.c [2021-11-09 10:50:50,732 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8922609e-4515-4067-ac34-4133acc5ebe0/bin/uautomizer-IVEQpCNsaX/data/89934f6ef/c2d3d10c72914fcd98fd745e1f41a6cd/FLAGb6f205899 [2021-11-09 10:50:51,086 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8922609e-4515-4067-ac34-4133acc5ebe0/bin/uautomizer-IVEQpCNsaX/data/89934f6ef/c2d3d10c72914fcd98fd745e1f41a6cd [2021-11-09 10:50:51,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 10:50:51,097 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 10:50:51,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 10:50:51,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 10:50:51,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 10:50:51,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:50:51" (1/1) ... [2021-11-09 10:50:51,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31fc916a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:51, skipping insertion in model container [2021-11-09 10:50:51,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:50:51" (1/1) ... [2021-11-09 10:50:51,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 10:50:51,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 10:50:51,327 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8922609e-4515-4067-ac34-4133acc5ebe0/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2021-11-09 10:50:51,332 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 10:50:51,342 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 10:50:51,374 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8922609e-4515-4067-ac34-4133acc5ebe0/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2021-11-09 10:50:51,376 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 10:50:51,390 INFO L208 MainTranslator]: Completed translation [2021-11-09 10:50:51,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:51 WrapperNode [2021-11-09 10:50:51,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 10:50:51,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 10:50:51,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 10:50:51,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 10:50:51,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:51" (1/1) ... [2021-11-09 10:50:51,417 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:51" (1/1) ... [2021-11-09 10:50:51,445 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 10:50:51,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 10:50:51,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 10:50:51,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 10:50:51,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:51" (1/1) ... [2021-11-09 10:50:51,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:51" (1/1) ... [2021-11-09 10:50:51,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:51" (1/1) ... [2021-11-09 10:50:51,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:51" (1/1) ... [2021-11-09 10:50:51,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:51" (1/1) ... [2021-11-09 10:50:51,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:51" (1/1) ... [2021-11-09 10:50:51,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:51" (1/1) ... [2021-11-09 10:50:51,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 10:50:51,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 10:50:51,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 10:50:51,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 10:50:51,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:51" (1/1) ... [2021-11-09 10:50:51,499 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 10:50:51,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8922609e-4515-4067-ac34-4133acc5ebe0/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:50:51,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8922609e-4515-4067-ac34-4133acc5ebe0/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-09 10:50:51,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8922609e-4515-4067-ac34-4133acc5ebe0/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-09 10:50:51,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 10:50:51,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 10:50:51,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 10:50:51,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 10:50:51,977 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 10:50:51,977 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-09 10:50:51,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:50:51 BoogieIcfgContainer [2021-11-09 10:50:51,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 10:50:51,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-09 10:50:51,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-09 10:50:51,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-09 10:50:51,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:50:51" (1/3) ... [2021-11-09 10:50:51,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2364c599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:50:51, skipping insertion in model container [2021-11-09 10:50:51,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:50:51" (2/3) ... [2021-11-09 10:50:51,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2364c599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:50:51, skipping insertion in model container [2021-11-09 10:50:51,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:50:51" (3/3) ... [2021-11-09 10:50:51,990 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2021-11-09 10:50:51,996 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-09 10:50:51,996 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-09 10:50:52,048 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-09 10:50:52,055 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-09 10:50:52,055 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-09 10:50:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 50 states have (on average 1.92) internal successors, (96), 51 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:52,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-09 10:50:52,081 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:52,082 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:50:52,083 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:52,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:52,089 INFO L85 PathProgramCache]: Analyzing trace with hash 792943379, now seen corresponding path program 1 times [2021-11-09 10:50:52,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:52,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226834197] [2021-11-09 10:50:52,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:52,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:52,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:52,464 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226834197] [2021-11-09 10:50:52,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226834197] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:52,465 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:52,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:52,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271706956] [2021-11-09 10:50:52,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:52,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:52,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:52,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:52,507 INFO L87 Difference]: Start difference. First operand has 52 states, 50 states have (on average 1.92) internal successors, (96), 51 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:52,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:52,595 INFO L93 Difference]: Finished difference Result 107 states and 193 transitions. [2021-11-09 10:50:52,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:52,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-09 10:50:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:52,613 INFO L225 Difference]: With dead ends: 107 [2021-11-09 10:50:52,613 INFO L226 Difference]: Without dead ends: 93 [2021-11-09 10:50:52,617 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:52,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-09 10:50:52,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2021-11-09 10:50:52,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 118 transitions. [2021-11-09 10:50:52,674 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 118 transitions. Word has length 21 [2021-11-09 10:50:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:52,676 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 118 transitions. [2021-11-09 10:50:52,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:52,677 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 118 transitions. [2021-11-09 10:50:52,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-09 10:50:52,680 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:52,681 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:50:52,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-09 10:50:52,682 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:52,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:52,689 INFO L85 PathProgramCache]: Analyzing trace with hash -795404523, now seen corresponding path program 1 times [2021-11-09 10:50:52,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:52,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300133907] [2021-11-09 10:50:52,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:52,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:52,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:52,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:52,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300133907] [2021-11-09 10:50:52,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300133907] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:52,825 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:52,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:52,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26102732] [2021-11-09 10:50:52,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:52,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:52,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:52,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:52,829 INFO L87 Difference]: Start difference. First operand 63 states and 118 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:52,856 INFO L93 Difference]: Finished difference Result 154 states and 289 transitions. [2021-11-09 10:50:52,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:52,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-09 10:50:52,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:52,859 INFO L225 Difference]: With dead ends: 154 [2021-11-09 10:50:52,859 INFO L226 Difference]: Without dead ends: 93 [2021-11-09 10:50:52,860 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:52,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-09 10:50:52,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2021-11-09 10:50:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.8888888888888888) internal successors, (170), 90 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 170 transitions. [2021-11-09 10:50:52,872 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 170 transitions. Word has length 21 [2021-11-09 10:50:52,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:52,873 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 170 transitions. [2021-11-09 10:50:52,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 170 transitions. [2021-11-09 10:50:52,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-09 10:50:52,876 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:52,877 INFO L513 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] [2021-11-09 10:50:52,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-09 10:50:52,877 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:52,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:52,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1188346975, now seen corresponding path program 1 times [2021-11-09 10:50:52,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:52,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500176612] [2021-11-09 10:50:52,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:52,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:52,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:52,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500176612] [2021-11-09 10:50:52,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500176612] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:52,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:52,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:52,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717979824] [2021-11-09 10:50:52,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:52,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:52,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:52,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:52,966 INFO L87 Difference]: Start difference. First operand 91 states and 170 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:52,996 INFO L93 Difference]: Finished difference Result 141 states and 258 transitions. [2021-11-09 10:50:52,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:52,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-09 10:50:52,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:52,999 INFO L225 Difference]: With dead ends: 141 [2021-11-09 10:50:52,999 INFO L226 Difference]: Without dead ends: 96 [2021-11-09 10:50:53,000 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-11-09 10:50:53,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2021-11-09 10:50:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 172 transitions. [2021-11-09 10:50:53,029 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 172 transitions. Word has length 22 [2021-11-09 10:50:53,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:53,030 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 172 transitions. [2021-11-09 10:50:53,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,031 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 172 transitions. [2021-11-09 10:50:53,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-09 10:50:53,032 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:53,032 INFO L513 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] [2021-11-09 10:50:53,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-09 10:50:53,033 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:53,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:53,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1112475615, now seen corresponding path program 1 times [2021-11-09 10:50:53,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:53,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458593593] [2021-11-09 10:50:53,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:53,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:53,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-11-09 10:50:53,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:53,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458593593] [2021-11-09 10:50:53,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458593593] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:53,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:53,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:53,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088910742] [2021-11-09 10:50:53,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:53,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:53,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:53,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:53,102 INFO L87 Difference]: Start difference. First operand 94 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:53,129 INFO L93 Difference]: Finished difference Result 181 states and 333 transitions. [2021-11-09 10:50:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:53,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-09 10:50:53,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:53,132 INFO L225 Difference]: With dead ends: 181 [2021-11-09 10:50:53,132 INFO L226 Difference]: Without dead ends: 179 [2021-11-09 10:50:53,133 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:53,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-11-09 10:50:53,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 125. [2021-11-09 10:50:53,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.846774193548387) internal successors, (229), 124 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 229 transitions. [2021-11-09 10:50:53,148 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 229 transitions. Word has length 22 [2021-11-09 10:50:53,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:53,149 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 229 transitions. [2021-11-09 10:50:53,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,149 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 229 transitions. [2021-11-09 10:50:53,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-09 10:50:53,151 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:53,151 INFO L513 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] [2021-11-09 10:50:53,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-09 10:50:53,152 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:53,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:53,153 INFO L85 PathProgramCache]: Analyzing trace with hash -475872287, now seen corresponding path program 1 times [2021-11-09 10:50:53,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:53,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688269634] [2021-11-09 10:50:53,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:53,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:53,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-11-09 10:50:53,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:53,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688269634] [2021-11-09 10:50:53,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688269634] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:53,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:53,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:53,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196030151] [2021-11-09 10:50:53,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:53,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:53,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:53,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:53,240 INFO L87 Difference]: Start difference. First operand 125 states and 229 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:53,266 INFO L93 Difference]: Finished difference Result 301 states and 555 transitions. [2021-11-09 10:50:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:53,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-09 10:50:53,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:53,269 INFO L225 Difference]: With dead ends: 301 [2021-11-09 10:50:53,273 INFO L226 Difference]: Without dead ends: 181 [2021-11-09 10:50:53,274 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:53,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-11-09 10:50:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2021-11-09 10:50:53,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.8370786516853932) internal successors, (327), 178 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 327 transitions. [2021-11-09 10:50:53,311 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 327 transitions. Word has length 22 [2021-11-09 10:50:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:53,311 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 327 transitions. [2021-11-09 10:50:53,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 327 transitions. [2021-11-09 10:50:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-09 10:50:53,314 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:53,314 INFO L513 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] [2021-11-09 10:50:53,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-09 10:50:53,330 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:53,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:53,332 INFO L85 PathProgramCache]: Analyzing trace with hash 127218090, now seen corresponding path program 1 times [2021-11-09 10:50:53,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:53,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696504672] [2021-11-09 10:50:53,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:53,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:53,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:53,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696504672] [2021-11-09 10:50:53,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696504672] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:53,450 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:53,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:53,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979725218] [2021-11-09 10:50:53,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:53,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:53,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:53,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:53,462 INFO L87 Difference]: Start difference. First operand 179 states and 327 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:53,483 INFO L93 Difference]: Finished difference Result 270 states and 490 transitions. [2021-11-09 10:50:53,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:53,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-09 10:50:53,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:53,494 INFO L225 Difference]: With dead ends: 270 [2021-11-09 10:50:53,494 INFO L226 Difference]: Without dead ends: 183 [2021-11-09 10:50:53,502 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:53,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-11-09 10:50:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2021-11-09 10:50:53,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.8166666666666667) internal successors, (327), 180 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 327 transitions. [2021-11-09 10:50:53,530 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 327 transitions. Word has length 23 [2021-11-09 10:50:53,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:53,530 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 327 transitions. [2021-11-09 10:50:53,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,531 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 327 transitions. [2021-11-09 10:50:53,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-09 10:50:53,538 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:53,538 INFO L513 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] [2021-11-09 10:50:53,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-09 10:50:53,539 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:53,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:53,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1866926616, now seen corresponding path program 1 times [2021-11-09 10:50:53,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:53,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392202523] [2021-11-09 10:50:53,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:53,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:53,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:53,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392202523] [2021-11-09 10:50:53,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392202523] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:53,588 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:53,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:53,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275142735] [2021-11-09 10:50:53,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:53,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:53,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:53,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:53,590 INFO L87 Difference]: Start difference. First operand 181 states and 327 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:53,611 INFO L93 Difference]: Finished difference Result 525 states and 953 transitions. [2021-11-09 10:50:53,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:53,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-09 10:50:53,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:53,614 INFO L225 Difference]: With dead ends: 525 [2021-11-09 10:50:53,615 INFO L226 Difference]: Without dead ends: 351 [2021-11-09 10:50:53,616 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:53,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2021-11-09 10:50:53,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2021-11-09 10:50:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.8017241379310345) internal successors, (627), 348 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 627 transitions. [2021-11-09 10:50:53,651 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 627 transitions. Word has length 23 [2021-11-09 10:50:53,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:53,651 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 627 transitions. [2021-11-09 10:50:53,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 627 transitions. [2021-11-09 10:50:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-09 10:50:53,654 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:53,654 INFO L513 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] [2021-11-09 10:50:53,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-09 10:50:53,655 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:53,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:53,655 INFO L85 PathProgramCache]: Analyzing trace with hash -278578714, now seen corresponding path program 1 times [2021-11-09 10:50:53,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:53,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465642571] [2021-11-09 10:50:53,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:53,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:53,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:53,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465642571] [2021-11-09 10:50:53,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465642571] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:53,707 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:53,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:53,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885508897] [2021-11-09 10:50:53,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:53,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:53,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:53,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:53,710 INFO L87 Difference]: Start difference. First operand 349 states and 627 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:53,744 INFO L93 Difference]: Finished difference Result 449 states and 813 transitions. [2021-11-09 10:50:53,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:53,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-09 10:50:53,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:53,749 INFO L225 Difference]: With dead ends: 449 [2021-11-09 10:50:53,750 INFO L226 Difference]: Without dead ends: 447 [2021-11-09 10:50:53,750 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:53,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-11-09 10:50:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 349. [2021-11-09 10:50:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.7902298850574712) internal successors, (623), 348 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 623 transitions. [2021-11-09 10:50:53,776 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 623 transitions. Word has length 23 [2021-11-09 10:50:53,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:53,777 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 623 transitions. [2021-11-09 10:50:53,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,777 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 623 transitions. [2021-11-09 10:50:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-09 10:50:53,778 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:53,779 INFO L513 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] [2021-11-09 10:50:53,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-09 10:50:53,779 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:53,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:53,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2039937514, now seen corresponding path program 1 times [2021-11-09 10:50:53,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:53,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857401441] [2021-11-09 10:50:53,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:53,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:53,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:53,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857401441] [2021-11-09 10:50:53,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857401441] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:53,817 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:53,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:53,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678288643] [2021-11-09 10:50:53,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:53,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:53,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:53,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:53,820 INFO L87 Difference]: Start difference. First operand 349 states and 623 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:53,844 INFO L93 Difference]: Finished difference Result 661 states and 1193 transitions. [2021-11-09 10:50:53,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:53,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-09 10:50:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:53,850 INFO L225 Difference]: With dead ends: 661 [2021-11-09 10:50:53,851 INFO L226 Difference]: Without dead ends: 659 [2021-11-09 10:50:53,851 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-11-09 10:50:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 481. [2021-11-09 10:50:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.7645833333333334) internal successors, (847), 480 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 847 transitions. [2021-11-09 10:50:53,874 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 847 transitions. Word has length 24 [2021-11-09 10:50:53,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:53,874 INFO L470 AbstractCegarLoop]: Abstraction has 481 states and 847 transitions. [2021-11-09 10:50:53,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 847 transitions. [2021-11-09 10:50:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-09 10:50:53,876 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:53,876 INFO L513 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] [2021-11-09 10:50:53,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-09 10:50:53,877 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:53,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:53,878 INFO L85 PathProgramCache]: Analyzing trace with hash 666681880, now seen corresponding path program 1 times [2021-11-09 10:50:53,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:53,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478222792] [2021-11-09 10:50:53,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:53,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:53,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:53,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478222792] [2021-11-09 10:50:53,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478222792] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:53,923 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:53,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:53,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510499522] [2021-11-09 10:50:53,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:53,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:53,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:53,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:53,926 INFO L87 Difference]: Start difference. First operand 481 states and 847 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:53,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:53,963 INFO L93 Difference]: Finished difference Result 1157 states and 2049 transitions. [2021-11-09 10:50:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:53,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-09 10:50:53,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:53,969 INFO L225 Difference]: With dead ends: 1157 [2021-11-09 10:50:53,970 INFO L226 Difference]: Without dead ends: 683 [2021-11-09 10:50:53,972 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:53,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2021-11-09 10:50:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2021-11-09 10:50:54,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 680 states have (on average 1.7573529411764706) internal successors, (1195), 680 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:54,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1195 transitions. [2021-11-09 10:50:54,008 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1195 transitions. Word has length 24 [2021-11-09 10:50:54,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:54,009 INFO L470 AbstractCegarLoop]: Abstraction has 681 states and 1195 transitions. [2021-11-09 10:50:54,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1195 transitions. [2021-11-09 10:50:54,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-09 10:50:54,011 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:54,011 INFO L513 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] [2021-11-09 10:50:54,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-09 10:50:54,012 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:54,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:54,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1186659581, now seen corresponding path program 1 times [2021-11-09 10:50:54,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:54,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228695170] [2021-11-09 10:50:54,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:54,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:54,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:54,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228695170] [2021-11-09 10:50:54,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228695170] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:54,104 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:54,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:54,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820373415] [2021-11-09 10:50:54,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:54,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:54,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:54,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:54,107 INFO L87 Difference]: Start difference. First operand 681 states and 1195 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:54,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:54,146 INFO L93 Difference]: Finished difference Result 1029 states and 1801 transitions. [2021-11-09 10:50:54,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:54,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-09 10:50:54,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:54,153 INFO L225 Difference]: With dead ends: 1029 [2021-11-09 10:50:54,154 INFO L226 Difference]: Without dead ends: 695 [2021-11-09 10:50:54,155 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:54,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2021-11-09 10:50:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 693. [2021-11-09 10:50:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.7384393063583814) internal successors, (1203), 692 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:54,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1203 transitions. [2021-11-09 10:50:54,189 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1203 transitions. Word has length 25 [2021-11-09 10:50:54,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:54,190 INFO L470 AbstractCegarLoop]: Abstraction has 693 states and 1203 transitions. [2021-11-09 10:50:54,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:54,190 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1203 transitions. [2021-11-09 10:50:54,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-09 10:50:54,194 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:54,195 INFO L513 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] [2021-11-09 10:50:54,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-09 10:50:54,196 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:54,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:54,208 INFO L85 PathProgramCache]: Analyzing trace with hash -807485125, now seen corresponding path program 1 times [2021-11-09 10:50:54,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:54,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692709512] [2021-11-09 10:50:54,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:54,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:54,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:54,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:54,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692709512] [2021-11-09 10:50:54,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692709512] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:54,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:54,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:54,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616225612] [2021-11-09 10:50:54,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:54,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:54,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:54,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:54,280 INFO L87 Difference]: Start difference. First operand 693 states and 1203 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:54,318 INFO L93 Difference]: Finished difference Result 1289 states and 2269 transitions. [2021-11-09 10:50:54,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:54,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-09 10:50:54,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:54,333 INFO L225 Difference]: With dead ends: 1289 [2021-11-09 10:50:54,333 INFO L226 Difference]: Without dead ends: 1287 [2021-11-09 10:50:54,334 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:54,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2021-11-09 10:50:54,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 965. [2021-11-09 10:50:54,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.704356846473029) internal successors, (1643), 964 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1643 transitions. [2021-11-09 10:50:54,376 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1643 transitions. Word has length 25 [2021-11-09 10:50:54,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:54,378 INFO L470 AbstractCegarLoop]: Abstraction has 965 states and 1643 transitions. [2021-11-09 10:50:54,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:54,379 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1643 transitions. [2021-11-09 10:50:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-09 10:50:54,381 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:54,381 INFO L513 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] [2021-11-09 10:50:54,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-09 10:50:54,382 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:54,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:54,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1899134269, now seen corresponding path program 1 times [2021-11-09 10:50:54,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:54,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950063049] [2021-11-09 10:50:54,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:54,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:54,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:54,419 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950063049] [2021-11-09 10:50:54,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950063049] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:54,420 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:54,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:54,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657564521] [2021-11-09 10:50:54,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:54,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:54,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:54,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:54,422 INFO L87 Difference]: Start difference. First operand 965 states and 1643 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:54,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:54,462 INFO L93 Difference]: Finished difference Result 2297 states and 3933 transitions. [2021-11-09 10:50:54,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:54,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-09 10:50:54,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:54,472 INFO L225 Difference]: With dead ends: 2297 [2021-11-09 10:50:54,472 INFO L226 Difference]: Without dead ends: 1351 [2021-11-09 10:50:54,474 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:54,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2021-11-09 10:50:54,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1349. [2021-11-09 10:50:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.6995548961424332) internal successors, (2291), 1348 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 2291 transitions. [2021-11-09 10:50:54,525 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 2291 transitions. Word has length 25 [2021-11-09 10:50:54,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:54,526 INFO L470 AbstractCegarLoop]: Abstraction has 1349 states and 2291 transitions. [2021-11-09 10:50:54,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:54,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 2291 transitions. [2021-11-09 10:50:54,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-09 10:50:54,529 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:54,529 INFO L513 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] [2021-11-09 10:50:54,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-09 10:50:54,530 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:54,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:54,530 INFO L85 PathProgramCache]: Analyzing trace with hash 737978317, now seen corresponding path program 1 times [2021-11-09 10:50:54,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:54,531 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033002141] [2021-11-09 10:50:54,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:54,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:54,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:54,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033002141] [2021-11-09 10:50:54,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033002141] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:54,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:54,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:54,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80010868] [2021-11-09 10:50:54,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:54,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:54,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:54,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:54,601 INFO L87 Difference]: Start difference. First operand 1349 states and 2291 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:54,637 INFO L93 Difference]: Finished difference Result 2025 states and 3429 transitions. [2021-11-09 10:50:54,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:54,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-09 10:50:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:54,647 INFO L225 Difference]: With dead ends: 2025 [2021-11-09 10:50:54,647 INFO L226 Difference]: Without dead ends: 1367 [2021-11-09 10:50:54,650 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2021-11-09 10:50:54,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1365. [2021-11-09 10:50:54,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1364 states have (on average 1.6796187683284458) internal successors, (2291), 1364 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:54,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2291 transitions. [2021-11-09 10:50:54,729 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2291 transitions. Word has length 26 [2021-11-09 10:50:54,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:54,730 INFO L470 AbstractCegarLoop]: Abstraction has 1365 states and 2291 transitions. [2021-11-09 10:50:54,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:54,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2291 transitions. [2021-11-09 10:50:54,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-09 10:50:54,733 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:54,733 INFO L513 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] [2021-11-09 10:50:54,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-09 10:50:54,734 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:54,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:54,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1256166389, now seen corresponding path program 1 times [2021-11-09 10:50:54,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:54,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125863790] [2021-11-09 10:50:54,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:54,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:54,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-11-09 10:50:54,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:54,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125863790] [2021-11-09 10:50:54,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125863790] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:54,781 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:54,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:54,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596306077] [2021-11-09 10:50:54,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:54,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:54,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:54,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:54,783 INFO L87 Difference]: Start difference. First operand 1365 states and 2291 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:54,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:54,826 INFO L93 Difference]: Finished difference Result 2505 states and 4277 transitions. [2021-11-09 10:50:54,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:54,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-09 10:50:54,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:54,842 INFO L225 Difference]: With dead ends: 2505 [2021-11-09 10:50:54,842 INFO L226 Difference]: Without dead ends: 2503 [2021-11-09 10:50:54,845 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:54,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2021-11-09 10:50:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1925. [2021-11-09 10:50:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.6398128898128899) internal successors, (3155), 1924 states have internal predecessors, (3155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 3155 transitions. [2021-11-09 10:50:54,919 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 3155 transitions. Word has length 26 [2021-11-09 10:50:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:54,919 INFO L470 AbstractCegarLoop]: Abstraction has 1925 states and 3155 transitions. [2021-11-09 10:50:54,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 3155 transitions. [2021-11-09 10:50:54,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-09 10:50:54,923 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:54,923 INFO L513 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] [2021-11-09 10:50:54,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-09 10:50:54,924 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:54,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:54,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1450453005, now seen corresponding path program 1 times [2021-11-09 10:50:54,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:54,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245207899] [2021-11-09 10:50:54,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:54,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:54,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:54,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245207899] [2021-11-09 10:50:54,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245207899] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:54,974 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:54,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:54,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401968012] [2021-11-09 10:50:54,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:54,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:54,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:54,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:54,976 INFO L87 Difference]: Start difference. First operand 1925 states and 3155 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:55,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:55,028 INFO L93 Difference]: Finished difference Result 4553 states and 7509 transitions. [2021-11-09 10:50:55,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:55,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-09 10:50:55,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:55,043 INFO L225 Difference]: With dead ends: 4553 [2021-11-09 10:50:55,043 INFO L226 Difference]: Without dead ends: 2663 [2021-11-09 10:50:55,048 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:55,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2021-11-09 10:50:55,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2661. [2021-11-09 10:50:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2661 states, 2660 states have (on average 1.637218045112782) internal successors, (4355), 2660 states have internal predecessors, (4355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 4355 transitions. [2021-11-09 10:50:55,158 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 4355 transitions. Word has length 26 [2021-11-09 10:50:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:55,159 INFO L470 AbstractCegarLoop]: Abstraction has 2661 states and 4355 transitions. [2021-11-09 10:50:55,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 4355 transitions. [2021-11-09 10:50:55,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-09 10:50:55,163 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:55,163 INFO L513 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] [2021-11-09 10:50:55,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-09 10:50:55,163 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:55,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:55,164 INFO L85 PathProgramCache]: Analyzing trace with hash -286238638, now seen corresponding path program 1 times [2021-11-09 10:50:55,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:55,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675475825] [2021-11-09 10:50:55,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:55,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:55,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:55,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675475825] [2021-11-09 10:50:55,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675475825] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:55,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:55,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:55,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734568125] [2021-11-09 10:50:55,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:55,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:55,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:55,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:55,194 INFO L87 Difference]: Start difference. First operand 2661 states and 4355 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:55,248 INFO L93 Difference]: Finished difference Result 3993 states and 6517 transitions. [2021-11-09 10:50:55,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:55,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-09 10:50:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:55,268 INFO L225 Difference]: With dead ends: 3993 [2021-11-09 10:50:55,268 INFO L226 Difference]: Without dead ends: 2695 [2021-11-09 10:50:55,271 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:55,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2021-11-09 10:50:55,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2693. [2021-11-09 10:50:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2693 states, 2692 states have (on average 1.6177563150074294) internal successors, (4355), 2692 states have internal predecessors, (4355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 4355 transitions. [2021-11-09 10:50:55,369 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 4355 transitions. Word has length 27 [2021-11-09 10:50:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:55,370 INFO L470 AbstractCegarLoop]: Abstraction has 2693 states and 4355 transitions. [2021-11-09 10:50:55,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:55,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 4355 transitions. [2021-11-09 10:50:55,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-09 10:50:55,373 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:55,374 INFO L513 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] [2021-11-09 10:50:55,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-09 10:50:55,374 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:55,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:55,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2014583952, now seen corresponding path program 1 times [2021-11-09 10:50:55,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:55,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715784165] [2021-11-09 10:50:55,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:55,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:55,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:55,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715784165] [2021-11-09 10:50:55,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715784165] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:55,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:55,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:55,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35567117] [2021-11-09 10:50:55,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:55,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:55,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:55,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:55,404 INFO L87 Difference]: Start difference. First operand 2693 states and 4355 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:55,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:55,491 INFO L93 Difference]: Finished difference Result 4873 states and 8037 transitions. [2021-11-09 10:50:55,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:55,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-09 10:50:55,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:55,521 INFO L225 Difference]: With dead ends: 4873 [2021-11-09 10:50:55,522 INFO L226 Difference]: Without dead ends: 4871 [2021-11-09 10:50:55,523 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2021-11-09 10:50:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 3845. [2021-11-09 10:50:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 3844 states have (on average 1.5741415192507804) internal successors, (6051), 3844 states have internal predecessors, (6051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 6051 transitions. [2021-11-09 10:50:55,656 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 6051 transitions. Word has length 27 [2021-11-09 10:50:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:55,656 INFO L470 AbstractCegarLoop]: Abstraction has 3845 states and 6051 transitions. [2021-11-09 10:50:55,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 6051 transitions. [2021-11-09 10:50:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-09 10:50:55,663 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:55,663 INFO L513 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] [2021-11-09 10:50:55,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-09 10:50:55,664 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:55,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:55,664 INFO L85 PathProgramCache]: Analyzing trace with hash 426236050, now seen corresponding path program 1 times [2021-11-09 10:50:55,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:55,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850374057] [2021-11-09 10:50:55,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:55,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:55,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:55,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850374057] [2021-11-09 10:50:55,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850374057] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:55,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:55,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:55,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179098208] [2021-11-09 10:50:55,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:55,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:55,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:55,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:55,692 INFO L87 Difference]: Start difference. First operand 3845 states and 6051 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:55,785 INFO L93 Difference]: Finished difference Result 9033 states and 14309 transitions. [2021-11-09 10:50:55,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:55,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-09 10:50:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:55,819 INFO L225 Difference]: With dead ends: 9033 [2021-11-09 10:50:55,819 INFO L226 Difference]: Without dead ends: 5255 [2021-11-09 10:50:55,825 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2021-11-09 10:50:56,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 5253. [2021-11-09 10:50:56,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5253 states, 5252 states have (on average 1.5725437928408226) internal successors, (8259), 5252 states have internal predecessors, (8259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5253 states to 5253 states and 8259 transitions. [2021-11-09 10:50:56,053 INFO L78 Accepts]: Start accepts. Automaton has 5253 states and 8259 transitions. Word has length 27 [2021-11-09 10:50:56,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:56,054 INFO L470 AbstractCegarLoop]: Abstraction has 5253 states and 8259 transitions. [2021-11-09 10:50:56,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:56,054 INFO L276 IsEmpty]: Start isEmpty. Operand 5253 states and 8259 transitions. [2021-11-09 10:50:56,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-09 10:50:56,061 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:56,061 INFO L513 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] [2021-11-09 10:50:56,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-09 10:50:56,061 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:56,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:56,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1972192830, now seen corresponding path program 1 times [2021-11-09 10:50:56,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:56,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269944106] [2021-11-09 10:50:56,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:56,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:56,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:56,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:56,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269944106] [2021-11-09 10:50:56,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269944106] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:56,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:56,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:56,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835805163] [2021-11-09 10:50:56,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:56,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:56,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:56,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:56,091 INFO L87 Difference]: Start difference. First operand 5253 states and 8259 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:56,165 INFO L93 Difference]: Finished difference Result 7881 states and 12357 transitions. [2021-11-09 10:50:56,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:56,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-09 10:50:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:56,180 INFO L225 Difference]: With dead ends: 7881 [2021-11-09 10:50:56,180 INFO L226 Difference]: Without dead ends: 5319 [2021-11-09 10:50:56,185 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:56,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2021-11-09 10:50:56,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 5317. [2021-11-09 10:50:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5317 states, 5316 states have (on average 1.5536117381489842) internal successors, (8259), 5316 states have internal predecessors, (8259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 8259 transitions. [2021-11-09 10:50:56,364 INFO L78 Accepts]: Start accepts. Automaton has 5317 states and 8259 transitions. Word has length 28 [2021-11-09 10:50:56,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:56,364 INFO L470 AbstractCegarLoop]: Abstraction has 5317 states and 8259 transitions. [2021-11-09 10:50:56,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:56,365 INFO L276 IsEmpty]: Start isEmpty. Operand 5317 states and 8259 transitions. [2021-11-09 10:50:56,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-09 10:50:56,370 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:56,371 INFO L513 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] [2021-11-09 10:50:56,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-09 10:50:56,371 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:56,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:56,372 INFO L85 PathProgramCache]: Analyzing trace with hash 328629760, now seen corresponding path program 1 times [2021-11-09 10:50:56,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:56,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820115530] [2021-11-09 10:50:56,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:56,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:56,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:56,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820115530] [2021-11-09 10:50:56,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820115530] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:56,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:56,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:56,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980391288] [2021-11-09 10:50:56,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:56,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:56,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:56,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:56,397 INFO L87 Difference]: Start difference. First operand 5317 states and 8259 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:56,503 INFO L93 Difference]: Finished difference Result 9481 states and 15045 transitions. [2021-11-09 10:50:56,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:56,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-09 10:50:56,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:56,527 INFO L225 Difference]: With dead ends: 9481 [2021-11-09 10:50:56,527 INFO L226 Difference]: Without dead ends: 9479 [2021-11-09 10:50:56,531 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9479 states. [2021-11-09 10:50:56,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9479 to 7685. [2021-11-09 10:50:56,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7685 states, 7684 states have (on average 1.5079385736595523) internal successors, (11587), 7684 states have internal predecessors, (11587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7685 states to 7685 states and 11587 transitions. [2021-11-09 10:50:56,771 INFO L78 Accepts]: Start accepts. Automaton has 7685 states and 11587 transitions. Word has length 28 [2021-11-09 10:50:56,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:56,771 INFO L470 AbstractCegarLoop]: Abstraction has 7685 states and 11587 transitions. [2021-11-09 10:50:56,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand 7685 states and 11587 transitions. [2021-11-09 10:50:56,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-09 10:50:56,783 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:56,783 INFO L513 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] [2021-11-09 10:50:56,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-09 10:50:56,784 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:56,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:56,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1259718142, now seen corresponding path program 1 times [2021-11-09 10:50:56,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:56,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137062341] [2021-11-09 10:50:56,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:56,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:56,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:56,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137062341] [2021-11-09 10:50:56,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137062341] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:56,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:56,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:56,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143680743] [2021-11-09 10:50:56,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:56,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:56,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:56,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:56,810 INFO L87 Difference]: Start difference. First operand 7685 states and 11587 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:56,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:56,988 INFO L93 Difference]: Finished difference Result 17929 states and 27205 transitions. [2021-11-09 10:50:56,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:56,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-09 10:50:56,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:57,009 INFO L225 Difference]: With dead ends: 17929 [2021-11-09 10:50:57,010 INFO L226 Difference]: Without dead ends: 10375 [2021-11-09 10:50:57,021 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:57,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10375 states. [2021-11-09 10:50:57,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10375 to 10373. [2021-11-09 10:50:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10373 states, 10372 states have (on average 1.5058812186656383) internal successors, (15619), 10372 states have internal predecessors, (15619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:57,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10373 states to 10373 states and 15619 transitions. [2021-11-09 10:50:57,386 INFO L78 Accepts]: Start accepts. Automaton has 10373 states and 15619 transitions. Word has length 28 [2021-11-09 10:50:57,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:57,387 INFO L470 AbstractCegarLoop]: Abstraction has 10373 states and 15619 transitions. [2021-11-09 10:50:57,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:57,387 INFO L276 IsEmpty]: Start isEmpty. Operand 10373 states and 15619 transitions. [2021-11-09 10:50:57,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-09 10:50:57,400 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:57,400 INFO L513 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] [2021-11-09 10:50:57,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-09 10:50:57,401 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:57,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:57,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1597802407, now seen corresponding path program 1 times [2021-11-09 10:50:57,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:57,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359670835] [2021-11-09 10:50:57,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:57,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:57,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-11-09 10:50:57,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:57,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359670835] [2021-11-09 10:50:57,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359670835] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:57,430 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:57,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:57,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115979859] [2021-11-09 10:50:57,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:57,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:57,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:57,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:57,435 INFO L87 Difference]: Start difference. First operand 10373 states and 15619 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:57,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:57,599 INFO L93 Difference]: Finished difference Result 15561 states and 23365 transitions. [2021-11-09 10:50:57,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:57,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-09 10:50:57,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:57,703 INFO L225 Difference]: With dead ends: 15561 [2021-11-09 10:50:57,704 INFO L226 Difference]: Without dead ends: 10503 [2021-11-09 10:50:57,710 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:57,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10503 states. [2021-11-09 10:50:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10503 to 10501. [2021-11-09 10:50:57,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10501 states, 10500 states have (on average 1.4875238095238095) internal successors, (15619), 10500 states have internal predecessors, (15619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:57,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10501 states to 10501 states and 15619 transitions. [2021-11-09 10:50:57,998 INFO L78 Accepts]: Start accepts. Automaton has 10501 states and 15619 transitions. Word has length 29 [2021-11-09 10:50:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:57,999 INFO L470 AbstractCegarLoop]: Abstraction has 10501 states and 15619 transitions. [2021-11-09 10:50:57,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:57,999 INFO L276 IsEmpty]: Start isEmpty. Operand 10501 states and 15619 transitions. [2021-11-09 10:50:58,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-09 10:50:58,078 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:58,078 INFO L513 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] [2021-11-09 10:50:58,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-09 10:50:58,078 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:58,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:58,079 INFO L85 PathProgramCache]: Analyzing trace with hash -396342299, now seen corresponding path program 1 times [2021-11-09 10:50:58,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:58,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531049905] [2021-11-09 10:50:58,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:58,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:58,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:58,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531049905] [2021-11-09 10:50:58,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531049905] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:58,107 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:58,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:58,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011289239] [2021-11-09 10:50:58,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:58,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:58,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:58,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:58,108 INFO L87 Difference]: Start difference. First operand 10501 states and 15619 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:58,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:58,308 INFO L93 Difference]: Finished difference Result 18441 states and 28037 transitions. [2021-11-09 10:50:58,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:58,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-09 10:50:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:58,348 INFO L225 Difference]: With dead ends: 18441 [2021-11-09 10:50:58,348 INFO L226 Difference]: Without dead ends: 18439 [2021-11-09 10:50:58,354 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18439 states. [2021-11-09 10:50:58,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18439 to 15365. [2021-11-09 10:50:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15365 states, 15364 states have (on average 1.4414865920333246) internal successors, (22147), 15364 states have internal predecessors, (22147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15365 states to 15365 states and 22147 transitions. [2021-11-09 10:50:58,854 INFO L78 Accepts]: Start accepts. Automaton has 15365 states and 22147 transitions. Word has length 29 [2021-11-09 10:50:58,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:50:58,854 INFO L470 AbstractCegarLoop]: Abstraction has 15365 states and 22147 transitions. [2021-11-09 10:50:58,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:58,854 INFO L276 IsEmpty]: Start isEmpty. Operand 15365 states and 22147 transitions. [2021-11-09 10:50:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-09 10:50:58,878 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:50:58,878 INFO L513 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] [2021-11-09 10:50:58,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-09 10:50:58,878 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:50:58,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:50:58,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1984690201, now seen corresponding path program 1 times [2021-11-09 10:50:58,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:50:58,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90138334] [2021-11-09 10:50:58,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:50:58,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:50:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:50:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:50:58,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:50:58,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90138334] [2021-11-09 10:50:58,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90138334] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:50:58,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:50:58,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:50:58,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407941085] [2021-11-09 10:50:58,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:50:58,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:50:58,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:50:58,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:58,911 INFO L87 Difference]: Start difference. First operand 15365 states and 22147 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:50:59,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:50:59,209 INFO L93 Difference]: Finished difference Result 35593 states and 51589 transitions. [2021-11-09 10:50:59,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:50:59,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-09 10:50:59,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:50:59,259 INFO L225 Difference]: With dead ends: 35593 [2021-11-09 10:50:59,259 INFO L226 Difference]: Without dead ends: 20487 [2021-11-09 10:50:59,283 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:50:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20487 states. [2021-11-09 10:50:59,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20487 to 20485. [2021-11-09 10:50:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20485 states, 20484 states have (on average 1.4373657488771725) internal successors, (29443), 20484 states have internal predecessors, (29443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20485 states to 20485 states and 29443 transitions. [2021-11-09 10:51:00,003 INFO L78 Accepts]: Start accepts. Automaton has 20485 states and 29443 transitions. Word has length 29 [2021-11-09 10:51:00,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:00,003 INFO L470 AbstractCegarLoop]: Abstraction has 20485 states and 29443 transitions. [2021-11-09 10:51:00,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:00,004 INFO L276 IsEmpty]: Start isEmpty. Operand 20485 states and 29443 transitions. [2021-11-09 10:51:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-09 10:51:00,025 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:00,025 INFO L513 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] [2021-11-09 10:51:00,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-09 10:51:00,026 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:00,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:00,026 INFO L85 PathProgramCache]: Analyzing trace with hash 598505399, now seen corresponding path program 1 times [2021-11-09 10:51:00,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:00,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882405109] [2021-11-09 10:51:00,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:00,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:51:00,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:00,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882405109] [2021-11-09 10:51:00,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882405109] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:00,047 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:00,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:00,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817631417] [2021-11-09 10:51:00,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:00,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:00,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:00,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:00,048 INFO L87 Difference]: Start difference. First operand 20485 states and 29443 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:00,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:00,264 INFO L93 Difference]: Finished difference Result 30729 states and 44037 transitions. [2021-11-09 10:51:00,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:00,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-09 10:51:00,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:00,307 INFO L225 Difference]: With dead ends: 30729 [2021-11-09 10:51:00,308 INFO L226 Difference]: Without dead ends: 20743 [2021-11-09 10:51:00,323 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:00,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20743 states. [2021-11-09 10:51:01,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20743 to 20741. [2021-11-09 10:51:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20741 states, 20740 states have (on average 1.4196239151398264) internal successors, (29443), 20740 states have internal predecessors, (29443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20741 states to 20741 states and 29443 transitions. [2021-11-09 10:51:01,148 INFO L78 Accepts]: Start accepts. Automaton has 20741 states and 29443 transitions. Word has length 30 [2021-11-09 10:51:01,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:01,148 INFO L470 AbstractCegarLoop]: Abstraction has 20741 states and 29443 transitions. [2021-11-09 10:51:01,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 20741 states and 29443 transitions. [2021-11-09 10:51:01,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-09 10:51:01,173 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:01,173 INFO L513 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] [2021-11-09 10:51:01,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-09 10:51:01,174 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:01,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:01,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1395639307, now seen corresponding path program 1 times [2021-11-09 10:51:01,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:01,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218807802] [2021-11-09 10:51:01,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:01,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:51:01,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:01,199 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218807802] [2021-11-09 10:51:01,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218807802] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:01,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:01,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:01,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262898700] [2021-11-09 10:51:01,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:01,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:01,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:01,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:01,205 INFO L87 Difference]: Start difference. First operand 20741 states and 29443 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:01,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:01,771 INFO L93 Difference]: Finished difference Result 35849 states and 51973 transitions. [2021-11-09 10:51:01,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:01,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-09 10:51:01,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:01,855 INFO L225 Difference]: With dead ends: 35849 [2021-11-09 10:51:01,855 INFO L226 Difference]: Without dead ends: 35847 [2021-11-09 10:51:01,865 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35847 states. [2021-11-09 10:51:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35847 to 30725. [2021-11-09 10:51:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30725 states, 30724 states have (on average 1.3749186303866685) internal successors, (42243), 30724 states have internal predecessors, (42243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30725 states to 30725 states and 42243 transitions. [2021-11-09 10:51:02,619 INFO L78 Accepts]: Start accepts. Automaton has 30725 states and 42243 transitions. Word has length 30 [2021-11-09 10:51:02,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:02,619 INFO L470 AbstractCegarLoop]: Abstraction has 30725 states and 42243 transitions. [2021-11-09 10:51:02,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:02,620 INFO L276 IsEmpty]: Start isEmpty. Operand 30725 states and 42243 transitions. [2021-11-09 10:51:02,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-09 10:51:02,676 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:02,676 INFO L513 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] [2021-11-09 10:51:02,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-09 10:51:02,677 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:02,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:02,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1310980087, now seen corresponding path program 1 times [2021-11-09 10:51:02,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:02,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535810538] [2021-11-09 10:51:02,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:02,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:51:02,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:02,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535810538] [2021-11-09 10:51:02,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535810538] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:02,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:02,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:02,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827274794] [2021-11-09 10:51:02,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:02,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:02,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:02,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:02,706 INFO L87 Difference]: Start difference. First operand 30725 states and 42243 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:03,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:03,399 INFO L93 Difference]: Finished difference Result 70665 states and 97541 transitions. [2021-11-09 10:51:03,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:03,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-09 10:51:03,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:03,476 INFO L225 Difference]: With dead ends: 70665 [2021-11-09 10:51:03,476 INFO L226 Difference]: Without dead ends: 40455 [2021-11-09 10:51:03,517 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:03,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40455 states. [2021-11-09 10:51:04,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40455 to 40453. [2021-11-09 10:51:04,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40453 states, 40452 states have (on average 1.367027588252744) internal successors, (55299), 40452 states have internal predecessors, (55299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40453 states to 40453 states and 55299 transitions. [2021-11-09 10:51:04,687 INFO L78 Accepts]: Start accepts. Automaton has 40453 states and 55299 transitions. Word has length 30 [2021-11-09 10:51:04,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:04,687 INFO L470 AbstractCegarLoop]: Abstraction has 40453 states and 55299 transitions. [2021-11-09 10:51:04,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:04,688 INFO L276 IsEmpty]: Start isEmpty. Operand 40453 states and 55299 transitions. [2021-11-09 10:51:04,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-09 10:51:04,891 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:04,891 INFO L513 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] [2021-11-09 10:51:04,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-09 10:51:04,891 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:04,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:04,892 INFO L85 PathProgramCache]: Analyzing trace with hash -314930436, now seen corresponding path program 1 times [2021-11-09 10:51:04,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:04,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144384523] [2021-11-09 10:51:04,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:04,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:51:04,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:04,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144384523] [2021-11-09 10:51:04,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144384523] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:04,940 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:04,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:04,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093553430] [2021-11-09 10:51:04,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:04,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:04,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:04,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:04,941 INFO L87 Difference]: Start difference. First operand 40453 states and 55299 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:05,440 INFO L93 Difference]: Finished difference Result 60681 states and 82693 transitions. [2021-11-09 10:51:05,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:05,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-09 10:51:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:05,493 INFO L225 Difference]: With dead ends: 60681 [2021-11-09 10:51:05,494 INFO L226 Difference]: Without dead ends: 40967 [2021-11-09 10:51:05,511 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:05,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40967 states. [2021-11-09 10:51:06,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40967 to 40965. [2021-11-09 10:51:06,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40965 states, 40964 states have (on average 1.3499414119714872) internal successors, (55299), 40964 states have internal predecessors, (55299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40965 states to 40965 states and 55299 transitions. [2021-11-09 10:51:06,525 INFO L78 Accepts]: Start accepts. Automaton has 40965 states and 55299 transitions. Word has length 31 [2021-11-09 10:51:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:06,525 INFO L470 AbstractCegarLoop]: Abstraction has 40965 states and 55299 transitions. [2021-11-09 10:51:06,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 40965 states and 55299 transitions. [2021-11-09 10:51:06,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-09 10:51:06,556 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:06,557 INFO L513 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] [2021-11-09 10:51:06,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-09 10:51:06,557 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:06,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:06,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1985892154, now seen corresponding path program 1 times [2021-11-09 10:51:06,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:06,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297372890] [2021-11-09 10:51:06,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:06,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:51:06,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:06,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297372890] [2021-11-09 10:51:06,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297372890] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:06,589 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:06,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:06,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213384102] [2021-11-09 10:51:06,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:06,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:06,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:06,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:06,590 INFO L87 Difference]: Start difference. First operand 40965 states and 55299 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:07,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:07,385 INFO L93 Difference]: Finished difference Result 119817 states and 159749 transitions. [2021-11-09 10:51:07,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:07,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-09 10:51:07,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:07,461 INFO L225 Difference]: With dead ends: 119817 [2021-11-09 10:51:07,461 INFO L226 Difference]: Without dead ends: 79879 [2021-11-09 10:51:07,495 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:07,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79879 states. [2021-11-09 10:51:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79879 to 79877. [2021-11-09 10:51:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79877 states, 79876 states have (on average 1.3076643797886724) internal successors, (104451), 79876 states have internal predecessors, (104451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:09,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79877 states to 79877 states and 104451 transitions. [2021-11-09 10:51:09,166 INFO L78 Accepts]: Start accepts. Automaton has 79877 states and 104451 transitions. Word has length 31 [2021-11-09 10:51:09,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:09,166 INFO L470 AbstractCegarLoop]: Abstraction has 79877 states and 104451 transitions. [2021-11-09 10:51:09,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 79877 states and 104451 transitions. [2021-11-09 10:51:09,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-09 10:51:09,231 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:09,231 INFO L513 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] [2021-11-09 10:51:09,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-09 10:51:09,231 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:09,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:09,232 INFO L85 PathProgramCache]: Analyzing trace with hash -720727240, now seen corresponding path program 1 times [2021-11-09 10:51:09,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:09,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350476831] [2021-11-09 10:51:09,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:09,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:51:09,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:09,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350476831] [2021-11-09 10:51:09,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350476831] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:09,257 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:09,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:09,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182735742] [2021-11-09 10:51:09,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:09,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:09,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:09,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:09,258 INFO L87 Difference]: Start difference. First operand 79877 states and 104451 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:10,293 INFO L93 Difference]: Finished difference Result 88073 states and 118789 transitions. [2021-11-09 10:51:10,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:10,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-09 10:51:10,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:10,378 INFO L225 Difference]: With dead ends: 88073 [2021-11-09 10:51:10,378 INFO L226 Difference]: Without dead ends: 88071 [2021-11-09 10:51:10,394 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:10,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88071 states. [2021-11-09 10:51:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88071 to 79877. [2021-11-09 10:51:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79877 states, 79876 states have (on average 1.2948445089889329) internal successors, (103427), 79876 states have internal predecessors, (103427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79877 states to 79877 states and 103427 transitions. [2021-11-09 10:51:12,176 INFO L78 Accepts]: Start accepts. Automaton has 79877 states and 103427 transitions. Word has length 31 [2021-11-09 10:51:12,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:12,182 INFO L470 AbstractCegarLoop]: Abstraction has 79877 states and 103427 transitions. [2021-11-09 10:51:12,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:12,182 INFO L276 IsEmpty]: Start isEmpty. Operand 79877 states and 103427 transitions. [2021-11-09 10:51:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-09 10:51:12,227 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:12,227 INFO L513 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] [2021-11-09 10:51:12,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-09 10:51:12,228 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:12,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:12,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1433330092, now seen corresponding path program 1 times [2021-11-09 10:51:12,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:12,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103394816] [2021-11-09 10:51:12,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:12,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:12,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:51:12,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:12,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103394816] [2021-11-09 10:51:12,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103394816] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:12,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:12,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:12,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651788080] [2021-11-09 10:51:12,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:12,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:12,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:12,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:12,264 INFO L87 Difference]: Start difference. First operand 79877 states and 103427 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:13,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:13,439 INFO L93 Difference]: Finished difference Result 134153 states and 176133 transitions. [2021-11-09 10:51:13,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:13,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-09 10:51:13,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:13,578 INFO L225 Difference]: With dead ends: 134153 [2021-11-09 10:51:13,578 INFO L226 Difference]: Without dead ends: 134151 [2021-11-09 10:51:13,594 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:13,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134151 states. [2021-11-09 10:51:15,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134151 to 121861. [2021-11-09 10:51:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121861 states, 121860 states have (on average 1.2604874446085672) internal successors, (153603), 121860 states have internal predecessors, (153603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121861 states to 121861 states and 153603 transitions. [2021-11-09 10:51:16,046 INFO L78 Accepts]: Start accepts. Automaton has 121861 states and 153603 transitions. Word has length 32 [2021-11-09 10:51:16,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:16,046 INFO L470 AbstractCegarLoop]: Abstraction has 121861 states and 153603 transitions. [2021-11-09 10:51:16,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 121861 states and 153603 transitions. [2021-11-09 10:51:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-09 10:51:16,122 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:16,123 INFO L513 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] [2021-11-09 10:51:16,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-09 10:51:16,123 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:16,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:16,123 INFO L85 PathProgramCache]: Analyzing trace with hash -155017810, now seen corresponding path program 1 times [2021-11-09 10:51:16,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:16,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740419377] [2021-11-09 10:51:16,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:16,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:51:16,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:16,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740419377] [2021-11-09 10:51:16,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740419377] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:16,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:16,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:16,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623166076] [2021-11-09 10:51:16,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:16,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:16,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:16,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:16,152 INFO L87 Difference]: Start difference. First operand 121861 states and 153603 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:18,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:18,203 INFO L93 Difference]: Finished difference Result 277513 states and 350213 transitions. [2021-11-09 10:51:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:18,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-09 10:51:18,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:18,820 INFO L225 Difference]: With dead ends: 277513 [2021-11-09 10:51:18,820 INFO L226 Difference]: Without dead ends: 156679 [2021-11-09 10:51:18,911 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:18,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156679 states. [2021-11-09 10:51:21,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156679 to 156677. [2021-11-09 10:51:21,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156677 states, 156676 states have (on average 1.2418175087441599) internal successors, (194563), 156676 states have internal predecessors, (194563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:22,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156677 states to 156677 states and 194563 transitions. [2021-11-09 10:51:22,031 INFO L78 Accepts]: Start accepts. Automaton has 156677 states and 194563 transitions. Word has length 32 [2021-11-09 10:51:22,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:22,031 INFO L470 AbstractCegarLoop]: Abstraction has 156677 states and 194563 transitions. [2021-11-09 10:51:22,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:22,031 INFO L276 IsEmpty]: Start isEmpty. Operand 156677 states and 194563 transitions. [2021-11-09 10:51:22,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-09 10:51:22,114 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:22,114 INFO L513 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] [2021-11-09 10:51:22,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-09 10:51:22,115 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:22,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:22,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1483775695, now seen corresponding path program 1 times [2021-11-09 10:51:22,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:22,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700891777] [2021-11-09 10:51:22,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:22,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:51:22,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:22,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700891777] [2021-11-09 10:51:22,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700891777] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:22,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:22,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:22,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997276133] [2021-11-09 10:51:22,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:22,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:22,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:22,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:22,145 INFO L87 Difference]: Start difference. First operand 156677 states and 194563 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:23,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:23,909 INFO L93 Difference]: Finished difference Result 236553 states and 293893 transitions. [2021-11-09 10:51:23,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:23,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-11-09 10:51:23,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:24,517 INFO L225 Difference]: With dead ends: 236553 [2021-11-09 10:51:24,517 INFO L226 Difference]: Without dead ends: 159751 [2021-11-09 10:51:24,564 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159751 states. [2021-11-09 10:51:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159751 to 159749. [2021-11-09 10:51:27,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159749 states, 159748 states have (on average 1.2307571925783107) internal successors, (196611), 159748 states have internal predecessors, (196611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159749 states to 159749 states and 196611 transitions. [2021-11-09 10:51:27,925 INFO L78 Accepts]: Start accepts. Automaton has 159749 states and 196611 transitions. Word has length 33 [2021-11-09 10:51:27,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:51:27,925 INFO L470 AbstractCegarLoop]: Abstraction has 159749 states and 196611 transitions. [2021-11-09 10:51:27,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:27,926 INFO L276 IsEmpty]: Start isEmpty. Operand 159749 states and 196611 transitions. [2021-11-09 10:51:28,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-09 10:51:28,013 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:51:28,013 INFO L513 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] [2021-11-09 10:51:28,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-09 10:51:28,013 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:51:28,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:51:28,014 INFO L85 PathProgramCache]: Analyzing trace with hash -510369011, now seen corresponding path program 1 times [2021-11-09 10:51:28,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:51:28,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581609465] [2021-11-09 10:51:28,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:51:28,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:51:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:51:28,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 10:51:28,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:51:28,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581609465] [2021-11-09 10:51:28,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581609465] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:51:28,046 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:51:28,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:51:28,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96549135] [2021-11-09 10:51:28,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:51:28,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:51:28,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:51:28,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:28,048 INFO L87 Difference]: Start difference. First operand 159749 states and 196611 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 10:51:30,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:51:30,949 INFO L93 Difference]: Finished difference Result 262153 states and 323589 transitions. [2021-11-09 10:51:30,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:51:30,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-11-09 10:51:30,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:51:31,270 INFO L225 Difference]: With dead ends: 262153 [2021-11-09 10:51:31,271 INFO L226 Difference]: Without dead ends: 262151 [2021-11-09 10:51:31,314 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:51:31,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262151 states. [2021-11-09 10:51:34,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262151 to 245765. [2021-11-09 10:51:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245765 states, 245764 states have (on average 1.1999926759004573) internal successors, (294915), 245764 states have internal predecessors, (294915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)