./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a93aa655-67f5-4c63-92e6-77149bef3fc6/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a93aa655-67f5-4c63-92e6-77149bef3fc6/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a93aa655-67f5-4c63-92e6-77149bef3fc6/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a93aa655-67f5-4c63-92e6-77149bef3fc6/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a93aa655-67f5-4c63-92e6-77149bef3fc6/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a93aa655-67f5-4c63-92e6-77149bef3fc6/bin/uautomizer-WNIpwEf4Nt --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 6423b7e5fbcc52c08e52aff49c79db620dd407c4 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:57:04,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:57:04,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:57:04,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:57:04,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:57:04,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:57:04,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:57:04,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:57:04,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:57:04,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:57:04,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:57:04,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:57:04,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:57:04,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:57:04,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:57:04,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:57:04,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:57:04,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:57:04,471 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:57:04,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:57:04,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:57:04,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:57:04,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:57:04,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:57:04,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:57:04,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:57:04,496 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:57:04,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:57:04,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:57:04,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:57:04,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:57:04,502 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:57:04,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:57:04,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:57:04,508 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:57:04,508 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:57:04,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:57:04,509 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:57:04,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:57:04,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:57:04,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:57:04,512 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a93aa655-67f5-4c63-92e6-77149bef3fc6/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 00:57:04,539 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:57:04,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:57:04,542 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:57:04,542 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:57:04,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:57:04,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:57:04,550 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:57:04,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:57:04,551 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:57:04,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:57:04,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:57:04,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:57:04,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 00:57:04,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:57:04,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 00:57:04,554 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:57:04,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:57:04,554 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:57:04,554 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 00:57:04,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:57:04,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:57:04,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:57:04,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:57:04,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:57:04,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:57:04,556 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 00:57:04,556 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:57:04,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:57:04,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 00:57:04,558 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:57:04,559 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_a93aa655-67f5-4c63-92e6-77149bef3fc6/bin/uautomizer-WNIpwEf4Nt/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_a93aa655-67f5-4c63-92e6-77149bef3fc6/bin/uautomizer-WNIpwEf4Nt 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 -> 6423b7e5fbcc52c08e52aff49c79db620dd407c4 [2021-10-13 00:57:04,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:57:04,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:57:04,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:57:04,906 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:57:04,907 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:57:04,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a93aa655-67f5-4c63-92e6-77149bef3fc6/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/locks/test_locks_10.c [2021-10-13 00:57:04,995 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a93aa655-67f5-4c63-92e6-77149bef3fc6/bin/uautomizer-WNIpwEf4Nt/data/2173b2d7b/6b3c8bc5fa564ea18ee86bb923515b6b/FLAGc43b4c236 [2021-10-13 00:57:05,462 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:57:05,463 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a93aa655-67f5-4c63-92e6-77149bef3fc6/sv-benchmarks/c/locks/test_locks_10.c [2021-10-13 00:57:05,471 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a93aa655-67f5-4c63-92e6-77149bef3fc6/bin/uautomizer-WNIpwEf4Nt/data/2173b2d7b/6b3c8bc5fa564ea18ee86bb923515b6b/FLAGc43b4c236 [2021-10-13 00:57:05,850 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a93aa655-67f5-4c63-92e6-77149bef3fc6/bin/uautomizer-WNIpwEf4Nt/data/2173b2d7b/6b3c8bc5fa564ea18ee86bb923515b6b [2021-10-13 00:57:05,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:57:05,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:57:05,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:57:05,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:57:05,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:57:05,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:57:05" (1/1) ... [2021-10-13 00:57:05,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@614ae54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:05, skipping insertion in model container [2021-10-13 00:57:05,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:57:05" (1/1) ... [2021-10-13 00:57:05,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:57:05,889 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:57:06,046 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_a93aa655-67f5-4c63-92e6-77149bef3fc6/sv-benchmarks/c/locks/test_locks_10.c[3901,3914] [2021-10-13 00:57:06,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:57:06,063 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:57:06,096 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_a93aa655-67f5-4c63-92e6-77149bef3fc6/sv-benchmarks/c/locks/test_locks_10.c[3901,3914] [2021-10-13 00:57:06,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:57:06,126 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:57:06,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:06 WrapperNode [2021-10-13 00:57:06,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:57:06,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:57:06,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:57:06,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:57:06,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:06" (1/1) ... [2021-10-13 00:57:06,159 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:06" (1/1) ... [2021-10-13 00:57:06,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:57:06,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:57:06,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:57:06,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:57:06,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:06" (1/1) ... [2021-10-13 00:57:06,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:06" (1/1) ... [2021-10-13 00:57:06,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:06" (1/1) ... [2021-10-13 00:57:06,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:06" (1/1) ... [2021-10-13 00:57:06,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:06" (1/1) ... [2021-10-13 00:57:06,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:06" (1/1) ... [2021-10-13 00:57:06,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:06" (1/1) ... [2021-10-13 00:57:06,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:57:06,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:57:06,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:57:06,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:57:06,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:06" (1/1) ... [2021-10-13 00:57:06,270 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:57:06,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a93aa655-67f5-4c63-92e6-77149bef3fc6/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:57:06,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a93aa655-67f5-4c63-92e6-77149bef3fc6/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:57:06,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a93aa655-67f5-4c63-92e6-77149bef3fc6/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:57:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:57:06,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:57:06,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:57:06,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:57:06,596 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:57:06,596 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-13 00:57:06,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:57:06 BoogieIcfgContainer [2021-10-13 00:57:06,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:57:06,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:57:06,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:57:06,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:57:06,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:57:05" (1/3) ... [2021-10-13 00:57:06,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3170f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:57:06, skipping insertion in model container [2021-10-13 00:57:06,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:06" (2/3) ... [2021-10-13 00:57:06,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3170f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:57:06, skipping insertion in model container [2021-10-13 00:57:06,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:57:06" (3/3) ... [2021-10-13 00:57:06,607 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2021-10-13 00:57:06,612 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:57:06,613 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 00:57:06,658 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:57:06,665 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 00:57:06,665 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 00:57:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 38 states have (on average 1.894736842105263) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:06,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 00:57:06,703 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:06,703 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:06,704 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:06,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:06,710 INFO L82 PathProgramCache]: Analyzing trace with hash 153349273, now seen corresponding path program 1 times [2021-10-13 00:57:06,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:06,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958636794] [2021-10-13 00:57:06,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:06,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:06,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:06,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958636794] [2021-10-13 00:57:06,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958636794] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:06,982 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:06,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:06,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670953685] [2021-10-13 00:57:06,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:06,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:07,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:07,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:07,004 INFO L87 Difference]: Start difference. First operand has 40 states, 38 states have (on average 1.894736842105263) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:07,045 INFO L93 Difference]: Finished difference Result 83 states and 145 transitions. [2021-10-13 00:57:07,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:07,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-13 00:57:07,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:07,057 INFO L225 Difference]: With dead ends: 83 [2021-10-13 00:57:07,057 INFO L226 Difference]: Without dead ends: 69 [2021-10-13 00:57:07,060 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:07,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-10-13 00:57:07,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2021-10-13 00:57:07,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 46 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 86 transitions. [2021-10-13 00:57:07,098 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 86 transitions. Word has length 17 [2021-10-13 00:57:07,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:07,099 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 86 transitions. [2021-10-13 00:57:07,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2021-10-13 00:57:07,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 00:57:07,101 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:07,101 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:07,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:57:07,101 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:07,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:07,102 INFO L82 PathProgramCache]: Analyzing trace with hash -433456741, now seen corresponding path program 1 times [2021-10-13 00:57:07,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:07,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831731160] [2021-10-13 00:57:07,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:07,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:07,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:07,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831731160] [2021-10-13 00:57:07,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831731160] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:07,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:07,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:07,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448828639] [2021-10-13 00:57:07,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:07,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:07,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:07,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:07,194 INFO L87 Difference]: Start difference. First operand 47 states and 86 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:07,227 INFO L93 Difference]: Finished difference Result 114 states and 209 transitions. [2021-10-13 00:57:07,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:07,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-13 00:57:07,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:07,231 INFO L225 Difference]: With dead ends: 114 [2021-10-13 00:57:07,231 INFO L226 Difference]: Without dead ends: 69 [2021-10-13 00:57:07,232 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:07,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-10-13 00:57:07,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2021-10-13 00:57:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 122 transitions. [2021-10-13 00:57:07,248 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 122 transitions. Word has length 17 [2021-10-13 00:57:07,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:07,249 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 122 transitions. [2021-10-13 00:57:07,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,249 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2021-10-13 00:57:07,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 00:57:07,254 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:07,254 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:07,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:57:07,255 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:07,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:07,261 INFO L82 PathProgramCache]: Analyzing trace with hash 459073515, now seen corresponding path program 1 times [2021-10-13 00:57:07,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:07,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295865534] [2021-10-13 00:57:07,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:07,264 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:07,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:07,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295865534] [2021-10-13 00:57:07,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295865534] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:07,335 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:07,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:07,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124546585] [2021-10-13 00:57:07,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:07,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:07,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:07,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:07,338 INFO L87 Difference]: Start difference. First operand 67 states and 122 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:07,359 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2021-10-13 00:57:07,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:07,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-13 00:57:07,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:07,363 INFO L225 Difference]: With dead ends: 105 [2021-10-13 00:57:07,364 INFO L226 Difference]: Without dead ends: 72 [2021-10-13 00:57:07,364 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:07,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-10-13 00:57:07,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2021-10-13 00:57:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 69 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 124 transitions. [2021-10-13 00:57:07,380 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 124 transitions. Word has length 18 [2021-10-13 00:57:07,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:07,380 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 124 transitions. [2021-10-13 00:57:07,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 124 transitions. [2021-10-13 00:57:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 00:57:07,382 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:07,382 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:07,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 00:57:07,383 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:07,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:07,384 INFO L82 PathProgramCache]: Analyzing trace with hash -552043735, now seen corresponding path program 1 times [2021-10-13 00:57:07,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:07,384 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423735159] [2021-10-13 00:57:07,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:07,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:07,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:07,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:07,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423735159] [2021-10-13 00:57:07,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423735159] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:07,469 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:07,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:07,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797104810] [2021-10-13 00:57:07,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:07,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:07,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:07,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:07,472 INFO L87 Difference]: Start difference. First operand 70 states and 124 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:07,521 INFO L93 Difference]: Finished difference Result 133 states and 237 transitions. [2021-10-13 00:57:07,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:07,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-13 00:57:07,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:07,524 INFO L225 Difference]: With dead ends: 133 [2021-10-13 00:57:07,525 INFO L226 Difference]: Without dead ends: 131 [2021-10-13 00:57:07,525 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:07,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-10-13 00:57:07,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 93. [2021-10-13 00:57:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.7934782608695652) internal successors, (165), 92 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 165 transitions. [2021-10-13 00:57:07,539 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 165 transitions. Word has length 18 [2021-10-13 00:57:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:07,539 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 165 transitions. [2021-10-13 00:57:07,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,540 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 165 transitions. [2021-10-13 00:57:07,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 00:57:07,541 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:07,541 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:07,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 00:57:07,542 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:07,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:07,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1138849749, now seen corresponding path program 1 times [2021-10-13 00:57:07,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:07,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255154100] [2021-10-13 00:57:07,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:07,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:07,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:07,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:07,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255154100] [2021-10-13 00:57:07,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255154100] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:07,601 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:07,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:07,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503746821] [2021-10-13 00:57:07,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:07,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:07,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:07,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:07,603 INFO L87 Difference]: Start difference. First operand 93 states and 165 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:07,622 INFO L93 Difference]: Finished difference Result 221 states and 395 transitions. [2021-10-13 00:57:07,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:07,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-13 00:57:07,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:07,624 INFO L225 Difference]: With dead ends: 221 [2021-10-13 00:57:07,624 INFO L226 Difference]: Without dead ends: 133 [2021-10-13 00:57:07,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:07,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-10-13 00:57:07,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2021-10-13 00:57:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.7769230769230768) internal successors, (231), 130 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 231 transitions. [2021-10-13 00:57:07,646 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 231 transitions. Word has length 18 [2021-10-13 00:57:07,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:07,647 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 231 transitions. [2021-10-13 00:57:07,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,647 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 231 transitions. [2021-10-13 00:57:07,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 00:57:07,648 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:07,648 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:07,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 00:57:07,648 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:07,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:07,649 INFO L82 PathProgramCache]: Analyzing trace with hash 66727088, now seen corresponding path program 1 times [2021-10-13 00:57:07,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:07,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661021503] [2021-10-13 00:57:07,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:07,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:07,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:07,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:07,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661021503] [2021-10-13 00:57:07,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661021503] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:07,731 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:07,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:07,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335585456] [2021-10-13 00:57:07,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:07,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:07,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:07,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:07,733 INFO L87 Difference]: Start difference. First operand 131 states and 231 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:07,764 INFO L93 Difference]: Finished difference Result 198 states and 346 transitions. [2021-10-13 00:57:07,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:07,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 00:57:07,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:07,766 INFO L225 Difference]: With dead ends: 198 [2021-10-13 00:57:07,766 INFO L226 Difference]: Without dead ends: 135 [2021-10-13 00:57:07,767 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-10-13 00:57:07,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2021-10-13 00:57:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.75) internal successors, (231), 132 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 231 transitions. [2021-10-13 00:57:07,791 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 231 transitions. Word has length 19 [2021-10-13 00:57:07,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:07,792 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 231 transitions. [2021-10-13 00:57:07,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 231 transitions. [2021-10-13 00:57:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 00:57:07,797 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:07,797 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:07,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 00:57:07,798 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:07,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:07,798 INFO L82 PathProgramCache]: Analyzing trace with hash -944390162, now seen corresponding path program 1 times [2021-10-13 00:57:07,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:07,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467227814] [2021-10-13 00:57:07,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:07,799 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:07,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:07,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467227814] [2021-10-13 00:57:07,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467227814] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:07,863 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:07,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:07,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072160894] [2021-10-13 00:57:07,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:07,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:07,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:07,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:07,867 INFO L87 Difference]: Start difference. First operand 133 states and 231 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:07,893 INFO L93 Difference]: Finished difference Result 381 states and 665 transitions. [2021-10-13 00:57:07,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:07,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 00:57:07,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:07,896 INFO L225 Difference]: With dead ends: 381 [2021-10-13 00:57:07,897 INFO L226 Difference]: Without dead ends: 255 [2021-10-13 00:57:07,898 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-10-13 00:57:07,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2021-10-13 00:57:07,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.7261904761904763) internal successors, (435), 252 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 435 transitions. [2021-10-13 00:57:07,917 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 435 transitions. Word has length 19 [2021-10-13 00:57:07,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:07,917 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 435 transitions. [2021-10-13 00:57:07,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,918 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 435 transitions. [2021-10-13 00:57:07,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 00:57:07,920 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:07,920 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:07,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 00:57:07,920 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:07,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:07,921 INFO L82 PathProgramCache]: Analyzing trace with hash -357584148, now seen corresponding path program 1 times [2021-10-13 00:57:07,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:07,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884555750] [2021-10-13 00:57:07,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:07,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:07,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:07,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884555750] [2021-10-13 00:57:07,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884555750] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:07,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:07,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:07,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168543288] [2021-10-13 00:57:07,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:07,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:07,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:07,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:07,958 INFO L87 Difference]: Start difference. First operand 253 states and 435 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:07,974 INFO L93 Difference]: Finished difference Result 321 states and 557 transitions. [2021-10-13 00:57:07,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:07,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 00:57:07,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:07,977 INFO L225 Difference]: With dead ends: 321 [2021-10-13 00:57:07,977 INFO L226 Difference]: Without dead ends: 319 [2021-10-13 00:57:07,978 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:07,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-10-13 00:57:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 253. [2021-10-13 00:57:07,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.7103174603174602) internal successors, (431), 252 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 431 transitions. [2021-10-13 00:57:07,995 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 431 transitions. Word has length 19 [2021-10-13 00:57:07,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:07,995 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 431 transitions. [2021-10-13 00:57:07,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:07,996 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 431 transitions. [2021-10-13 00:57:07,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 00:57:07,998 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:07,998 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:07,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 00:57:07,998 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:07,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:07,999 INFO L82 PathProgramCache]: Analyzing trace with hash 788890080, now seen corresponding path program 1 times [2021-10-13 00:57:07,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:07,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037079755] [2021-10-13 00:57:07,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:08,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:08,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:08,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037079755] [2021-10-13 00:57:08,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037079755] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:08,037 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:08,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:08,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377290580] [2021-10-13 00:57:08,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:08,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:08,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:08,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:08,039 INFO L87 Difference]: Start difference. First operand 253 states and 431 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:08,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:08,059 INFO L93 Difference]: Finished difference Result 469 states and 809 transitions. [2021-10-13 00:57:08,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:08,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-13 00:57:08,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:08,063 INFO L225 Difference]: With dead ends: 469 [2021-10-13 00:57:08,063 INFO L226 Difference]: Without dead ends: 467 [2021-10-13 00:57:08,064 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:08,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2021-10-13 00:57:08,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 353. [2021-10-13 00:57:08,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.6789772727272727) internal successors, (591), 352 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 591 transitions. [2021-10-13 00:57:08,084 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 591 transitions. Word has length 20 [2021-10-13 00:57:08,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:08,085 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 591 transitions. [2021-10-13 00:57:08,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:08,085 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 591 transitions. [2021-10-13 00:57:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 00:57:08,088 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:08,088 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:08,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 00:57:08,088 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:08,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:08,089 INFO L82 PathProgramCache]: Analyzing trace with hash 202084066, now seen corresponding path program 1 times [2021-10-13 00:57:08,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:08,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223685139] [2021-10-13 00:57:08,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:08,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:08,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:08,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223685139] [2021-10-13 00:57:08,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223685139] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:08,120 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:08,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:08,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298319941] [2021-10-13 00:57:08,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:08,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:08,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:08,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:08,122 INFO L87 Difference]: Start difference. First operand 353 states and 591 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:08,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:08,144 INFO L93 Difference]: Finished difference Result 837 states and 1409 transitions. [2021-10-13 00:57:08,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:08,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-13 00:57:08,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:08,148 INFO L225 Difference]: With dead ends: 837 [2021-10-13 00:57:08,148 INFO L226 Difference]: Without dead ends: 491 [2021-10-13 00:57:08,150 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:08,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2021-10-13 00:57:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 489. [2021-10-13 00:57:08,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 1.6618852459016393) internal successors, (811), 488 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 811 transitions. [2021-10-13 00:57:08,183 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 811 transitions. Word has length 20 [2021-10-13 00:57:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:08,184 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 811 transitions. [2021-10-13 00:57:08,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 811 transitions. [2021-10-13 00:57:08,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:57:08,195 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:08,195 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:08,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 00:57:08,196 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:08,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:08,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1313996925, now seen corresponding path program 1 times [2021-10-13 00:57:08,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:08,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405165810] [2021-10-13 00:57:08,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:08,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:08,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:08,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:08,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405165810] [2021-10-13 00:57:08,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405165810] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:08,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:08,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:08,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627963821] [2021-10-13 00:57:08,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:08,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:08,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:08,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:08,256 INFO L87 Difference]: Start difference. First operand 489 states and 811 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:08,292 INFO L93 Difference]: Finished difference Result 741 states and 1225 transitions. [2021-10-13 00:57:08,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:08,293 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-10-13 00:57:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:08,296 INFO L225 Difference]: With dead ends: 741 [2021-10-13 00:57:08,296 INFO L226 Difference]: Without dead ends: 503 [2021-10-13 00:57:08,301 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:08,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2021-10-13 00:57:08,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2021-10-13 00:57:08,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.638) internal successors, (819), 500 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:08,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 819 transitions. [2021-10-13 00:57:08,325 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 819 transitions. Word has length 21 [2021-10-13 00:57:08,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:08,325 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 819 transitions. [2021-10-13 00:57:08,325 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-10-13 00:57:08,325 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 819 transitions. [2021-10-13 00:57:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:57:08,327 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:08,327 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:08,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 00:57:08,327 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:08,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:08,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1969853121, now seen corresponding path program 1 times [2021-10-13 00:57:08,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:08,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593385998] [2021-10-13 00:57:08,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:08,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:08,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:08,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593385998] [2021-10-13 00:57:08,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593385998] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:08,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:08,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:08,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870841126] [2021-10-13 00:57:08,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:08,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:08,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:08,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:08,390 INFO L87 Difference]: Start difference. First operand 501 states and 819 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:08,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:08,429 INFO L93 Difference]: Finished difference Result 905 states and 1501 transitions. [2021-10-13 00:57:08,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:08,430 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-10-13 00:57:08,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:08,435 INFO L225 Difference]: With dead ends: 905 [2021-10-13 00:57:08,436 INFO L226 Difference]: Without dead ends: 903 [2021-10-13 00:57:08,436 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:08,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2021-10-13 00:57:08,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 709. [2021-10-13 00:57:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 708 states have (on average 1.597457627118644) internal successors, (1131), 708 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1131 transitions. [2021-10-13 00:57:08,465 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1131 transitions. Word has length 21 [2021-10-13 00:57:08,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:08,467 INFO L470 AbstractCegarLoop]: Abstraction has 709 states and 1131 transitions. [2021-10-13 00:57:08,468 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-10-13 00:57:08,468 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1131 transitions. [2021-10-13 00:57:08,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:57:08,478 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:08,479 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:08,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 00:57:08,479 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:08,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:08,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1383047107, now seen corresponding path program 1 times [2021-10-13 00:57:08,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:08,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978370171] [2021-10-13 00:57:08,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:08,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:08,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:08,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:08,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978370171] [2021-10-13 00:57:08,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978370171] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:08,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:08,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:08,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782792078] [2021-10-13 00:57:08,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:08,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:08,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:08,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:08,528 INFO L87 Difference]: Start difference. First operand 709 states and 1131 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:08,587 INFO L93 Difference]: Finished difference Result 1657 states and 2653 transitions. [2021-10-13 00:57:08,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:08,588 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-10-13 00:57:08,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:08,594 INFO L225 Difference]: With dead ends: 1657 [2021-10-13 00:57:08,594 INFO L226 Difference]: Without dead ends: 967 [2021-10-13 00:57:08,596 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:08,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2021-10-13 00:57:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 965. [2021-10-13 00:57:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.579875518672199) internal successors, (1523), 964 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1523 transitions. [2021-10-13 00:57:08,638 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1523 transitions. Word has length 21 [2021-10-13 00:57:08,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:08,638 INFO L470 AbstractCegarLoop]: Abstraction has 965 states and 1523 transitions. [2021-10-13 00:57:08,639 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-10-13 00:57:08,639 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1523 transitions. [2021-10-13 00:57:08,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:57:08,641 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:08,642 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:08,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 00:57:08,642 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:08,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:08,643 INFO L82 PathProgramCache]: Analyzing trace with hash 936119319, now seen corresponding path program 1 times [2021-10-13 00:57:08,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:08,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550566181] [2021-10-13 00:57:08,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:08,643 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:08,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:08,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550566181] [2021-10-13 00:57:08,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550566181] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:08,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:08,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:08,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28631806] [2021-10-13 00:57:08,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:08,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:08,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:08,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:08,710 INFO L87 Difference]: Start difference. First operand 965 states and 1523 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:08,737 INFO L93 Difference]: Finished difference Result 1449 states and 2277 transitions. [2021-10-13 00:57:08,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:08,738 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-10-13 00:57:08,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:08,744 INFO L225 Difference]: With dead ends: 1449 [2021-10-13 00:57:08,744 INFO L226 Difference]: Without dead ends: 983 [2021-10-13 00:57:08,746 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2021-10-13 00:57:08,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 981. [2021-10-13 00:57:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 1.5540816326530613) internal successors, (1523), 980 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1523 transitions. [2021-10-13 00:57:08,781 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1523 transitions. Word has length 22 [2021-10-13 00:57:08,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:08,781 INFO L470 AbstractCegarLoop]: Abstraction has 981 states and 1523 transitions. [2021-10-13 00:57:08,782 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-10-13 00:57:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1523 transitions. [2021-10-13 00:57:08,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:57:08,783 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:08,784 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:08,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 00:57:08,784 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:08,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:08,784 INFO L82 PathProgramCache]: Analyzing trace with hash -74997931, now seen corresponding path program 1 times [2021-10-13 00:57:08,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:08,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464624415] [2021-10-13 00:57:08,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:08,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:08,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:08,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464624415] [2021-10-13 00:57:08,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464624415] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:08,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:08,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:08,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017137899] [2021-10-13 00:57:08,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:08,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:08,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:08,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:08,818 INFO L87 Difference]: Start difference. First operand 981 states and 1523 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:08,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:08,853 INFO L93 Difference]: Finished difference Result 1737 states and 2741 transitions. [2021-10-13 00:57:08,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:08,854 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-10-13 00:57:08,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:08,865 INFO L225 Difference]: With dead ends: 1737 [2021-10-13 00:57:08,865 INFO L226 Difference]: Without dead ends: 1735 [2021-10-13 00:57:08,868 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:08,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2021-10-13 00:57:08,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1413. [2021-10-13 00:57:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1412 states have (on average 1.5092067988668556) internal successors, (2131), 1412 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2131 transitions. [2021-10-13 00:57:08,919 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2131 transitions. Word has length 22 [2021-10-13 00:57:08,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:08,920 INFO L470 AbstractCegarLoop]: Abstraction has 1413 states and 2131 transitions. [2021-10-13 00:57:08,920 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-10-13 00:57:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2131 transitions. [2021-10-13 00:57:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:57:08,923 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:08,923 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:08,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 00:57:08,923 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:08,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:08,924 INFO L82 PathProgramCache]: Analyzing trace with hash -661803945, now seen corresponding path program 1 times [2021-10-13 00:57:08,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:08,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326003785] [2021-10-13 00:57:08,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:08,924 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:08,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:08,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326003785] [2021-10-13 00:57:08,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326003785] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:08,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:08,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:08,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966677301] [2021-10-13 00:57:08,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:08,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:08,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:08,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:08,962 INFO L87 Difference]: Start difference. First operand 1413 states and 2131 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:09,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:09,012 INFO L93 Difference]: Finished difference Result 3273 states and 4949 transitions. [2021-10-13 00:57:09,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:09,013 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-10-13 00:57:09,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:09,023 INFO L225 Difference]: With dead ends: 3273 [2021-10-13 00:57:09,023 INFO L226 Difference]: Without dead ends: 1895 [2021-10-13 00:57:09,025 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:09,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2021-10-13 00:57:09,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1893. [2021-10-13 00:57:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1892 states have (on average 1.4899577167019027) internal successors, (2819), 1892 states have internal predecessors, (2819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:09,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2819 transitions. [2021-10-13 00:57:09,087 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2819 transitions. Word has length 22 [2021-10-13 00:57:09,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:09,088 INFO L470 AbstractCegarLoop]: Abstraction has 1893 states and 2819 transitions. [2021-10-13 00:57:09,088 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-10-13 00:57:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2819 transitions. [2021-10-13 00:57:09,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 00:57:09,092 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:09,092 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:09,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 00:57:09,092 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:09,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:09,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1970246488, now seen corresponding path program 1 times [2021-10-13 00:57:09,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:09,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472054727] [2021-10-13 00:57:09,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:09,095 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:09,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:09,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472054727] [2021-10-13 00:57:09,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472054727] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:09,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:09,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:09,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967432588] [2021-10-13 00:57:09,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:09,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:09,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:09,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:09,138 INFO L87 Difference]: Start difference. First operand 1893 states and 2819 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:09,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:09,181 INFO L93 Difference]: Finished difference Result 2841 states and 4213 transitions. [2021-10-13 00:57:09,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:09,181 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-10-13 00:57:09,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:09,192 INFO L225 Difference]: With dead ends: 2841 [2021-10-13 00:57:09,192 INFO L226 Difference]: Without dead ends: 1927 [2021-10-13 00:57:09,197 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:09,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2021-10-13 00:57:09,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1925. [2021-10-13 00:57:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.4651767151767152) internal successors, (2819), 1924 states have internal predecessors, (2819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:09,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2819 transitions. [2021-10-13 00:57:09,262 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2819 transitions. Word has length 23 [2021-10-13 00:57:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:09,262 INFO L470 AbstractCegarLoop]: Abstraction has 1925 states and 2819 transitions. [2021-10-13 00:57:09,263 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-10-13 00:57:09,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2819 transitions. [2021-10-13 00:57:09,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 00:57:09,266 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:09,266 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:09,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 00:57:09,266 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:09,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:09,267 INFO L82 PathProgramCache]: Analyzing trace with hash 959129238, now seen corresponding path program 1 times [2021-10-13 00:57:09,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:09,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965050781] [2021-10-13 00:57:09,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:09,268 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:09,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:09,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:09,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965050781] [2021-10-13 00:57:09,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965050781] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:09,295 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:09,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:09,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478059984] [2021-10-13 00:57:09,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:09,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:09,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:09,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:09,298 INFO L87 Difference]: Start difference. First operand 1925 states and 2819 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:09,369 INFO L93 Difference]: Finished difference Result 3337 states and 4965 transitions. [2021-10-13 00:57:09,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:09,370 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-10-13 00:57:09,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:09,389 INFO L225 Difference]: With dead ends: 3337 [2021-10-13 00:57:09,389 INFO L226 Difference]: Without dead ends: 3335 [2021-10-13 00:57:09,390 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:09,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2021-10-13 00:57:09,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 2821. [2021-10-13 00:57:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2821 states, 2820 states have (on average 1.4195035460992909) internal successors, (4003), 2820 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 4003 transitions. [2021-10-13 00:57:09,502 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 4003 transitions. Word has length 23 [2021-10-13 00:57:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:09,503 INFO L470 AbstractCegarLoop]: Abstraction has 2821 states and 4003 transitions. [2021-10-13 00:57:09,503 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-10-13 00:57:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 4003 transitions. [2021-10-13 00:57:09,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 00:57:09,508 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:09,508 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:09,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 00:57:09,508 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:09,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:09,509 INFO L82 PathProgramCache]: Analyzing trace with hash 372323224, now seen corresponding path program 1 times [2021-10-13 00:57:09,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:09,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743019011] [2021-10-13 00:57:09,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:09,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:09,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:09,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743019011] [2021-10-13 00:57:09,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743019011] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:09,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:09,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:09,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997689128] [2021-10-13 00:57:09,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:09,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:09,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:09,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:09,542 INFO L87 Difference]: Start difference. First operand 2821 states and 4003 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:09,620 INFO L93 Difference]: Finished difference Result 6473 states and 9189 transitions. [2021-10-13 00:57:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:09,620 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-10-13 00:57:09,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:09,640 INFO L225 Difference]: With dead ends: 6473 [2021-10-13 00:57:09,640 INFO L226 Difference]: Without dead ends: 3719 [2021-10-13 00:57:09,644 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:09,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2021-10-13 00:57:09,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3717. [2021-10-13 00:57:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3717 states, 3716 states have (on average 1.3958557588805167) internal successors, (5187), 3716 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3717 states to 3717 states and 5187 transitions. [2021-10-13 00:57:09,803 INFO L78 Accepts]: Start accepts. Automaton has 3717 states and 5187 transitions. Word has length 23 [2021-10-13 00:57:09,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:09,803 INFO L470 AbstractCegarLoop]: Abstraction has 3717 states and 5187 transitions. [2021-10-13 00:57:09,803 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-10-13 00:57:09,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3717 states and 5187 transitions. [2021-10-13 00:57:09,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 00:57:09,808 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:09,808 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:09,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 00:57:09,809 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:09,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:09,809 INFO L82 PathProgramCache]: Analyzing trace with hash -331549300, now seen corresponding path program 1 times [2021-10-13 00:57:09,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:09,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397519918] [2021-10-13 00:57:09,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:09,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:09,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:09,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:09,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397519918] [2021-10-13 00:57:09,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397519918] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:09,838 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:09,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:09,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657993863] [2021-10-13 00:57:09,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:09,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:09,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:09,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:09,840 INFO L87 Difference]: Start difference. First operand 3717 states and 5187 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:09,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:09,906 INFO L93 Difference]: Finished difference Result 5577 states and 7749 transitions. [2021-10-13 00:57:09,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:09,906 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-10-13 00:57:09,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:09,926 INFO L225 Difference]: With dead ends: 5577 [2021-10-13 00:57:09,926 INFO L226 Difference]: Without dead ends: 3783 [2021-10-13 00:57:09,929 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:09,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2021-10-13 00:57:10,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3781. [2021-10-13 00:57:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3781 states, 3780 states have (on average 1.3722222222222222) internal successors, (5187), 3780 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 5187 transitions. [2021-10-13 00:57:10,093 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 5187 transitions. Word has length 24 [2021-10-13 00:57:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:10,093 INFO L470 AbstractCegarLoop]: Abstraction has 3781 states and 5187 transitions. [2021-10-13 00:57:10,093 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-10-13 00:57:10,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 5187 transitions. [2021-10-13 00:57:10,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 00:57:10,098 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:10,099 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:10,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 00:57:10,099 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:10,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:10,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1342666550, now seen corresponding path program 1 times [2021-10-13 00:57:10,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:10,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893769639] [2021-10-13 00:57:10,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:10,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:10,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:10,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893769639] [2021-10-13 00:57:10,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893769639] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:10,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:10,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:10,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871849630] [2021-10-13 00:57:10,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:10,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:10,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:10,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:10,134 INFO L87 Difference]: Start difference. First operand 3781 states and 5187 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:10,245 INFO L93 Difference]: Finished difference Result 6409 states and 8901 transitions. [2021-10-13 00:57:10,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:10,245 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-10-13 00:57:10,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:10,288 INFO L225 Difference]: With dead ends: 6409 [2021-10-13 00:57:10,288 INFO L226 Difference]: Without dead ends: 6407 [2021-10-13 00:57:10,290 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:10,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6407 states. [2021-10-13 00:57:10,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6407 to 5637. [2021-10-13 00:57:10,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5637 states, 5636 states have (on average 1.3291341376863024) internal successors, (7491), 5636 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:10,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 7491 transitions. [2021-10-13 00:57:10,501 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 7491 transitions. Word has length 24 [2021-10-13 00:57:10,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:10,501 INFO L470 AbstractCegarLoop]: Abstraction has 5637 states and 7491 transitions. [2021-10-13 00:57:10,502 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-10-13 00:57:10,502 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 7491 transitions. [2021-10-13 00:57:10,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 00:57:10,515 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:10,515 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:10,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 00:57:10,516 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:10,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:10,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1929472564, now seen corresponding path program 1 times [2021-10-13 00:57:10,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:10,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725966614] [2021-10-13 00:57:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:10,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:10,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:10,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725966614] [2021-10-13 00:57:10,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725966614] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:10,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:10,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:10,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490619184] [2021-10-13 00:57:10,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:10,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:10,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:10,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:10,546 INFO L87 Difference]: Start difference. First operand 5637 states and 7491 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:10,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:10,731 INFO L93 Difference]: Finished difference Result 12809 states and 16965 transitions. [2021-10-13 00:57:10,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:10,732 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-10-13 00:57:10,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:10,747 INFO L225 Difference]: With dead ends: 12809 [2021-10-13 00:57:10,747 INFO L226 Difference]: Without dead ends: 7303 [2021-10-13 00:57:10,755 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:10,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7303 states. [2021-10-13 00:57:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7303 to 7301. [2021-10-13 00:57:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7301 states, 7300 states have (on average 1.297945205479452) internal successors, (9475), 7300 states have internal predecessors, (9475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:11,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7301 states to 7301 states and 9475 transitions. [2021-10-13 00:57:11,065 INFO L78 Accepts]: Start accepts. Automaton has 7301 states and 9475 transitions. Word has length 24 [2021-10-13 00:57:11,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:11,066 INFO L470 AbstractCegarLoop]: Abstraction has 7301 states and 9475 transitions. [2021-10-13 00:57:11,066 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-10-13 00:57:11,066 INFO L276 IsEmpty]: Start isEmpty. Operand 7301 states and 9475 transitions. [2021-10-13 00:57:11,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 00:57:11,076 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:11,076 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:11,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 00:57:11,076 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:11,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:11,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1327225645, now seen corresponding path program 1 times [2021-10-13 00:57:11,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:11,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031572471] [2021-10-13 00:57:11,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:11,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:11,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:11,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031572471] [2021-10-13 00:57:11,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031572471] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:11,109 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:11,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:11,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264825166] [2021-10-13 00:57:11,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:11,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:11,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:11,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:11,113 INFO L87 Difference]: Start difference. First operand 7301 states and 9475 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:11,243 INFO L93 Difference]: Finished difference Result 10953 states and 14149 transitions. [2021-10-13 00:57:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:11,244 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-10-13 00:57:11,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:11,259 INFO L225 Difference]: With dead ends: 10953 [2021-10-13 00:57:11,259 INFO L226 Difference]: Without dead ends: 7431 [2021-10-13 00:57:11,265 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:11,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2021-10-13 00:57:11,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 7429. [2021-10-13 00:57:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7429 states, 7428 states have (on average 1.2755788906838987) internal successors, (9475), 7428 states have internal predecessors, (9475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 9475 transitions. [2021-10-13 00:57:11,529 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 9475 transitions. Word has length 25 [2021-10-13 00:57:11,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:11,529 INFO L470 AbstractCegarLoop]: Abstraction has 7429 states and 9475 transitions. [2021-10-13 00:57:11,529 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-10-13 00:57:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 9475 transitions. [2021-10-13 00:57:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 00:57:11,540 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:11,540 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:11,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 00:57:11,540 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:11,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:11,541 INFO L82 PathProgramCache]: Analyzing trace with hash 316108395, now seen corresponding path program 1 times [2021-10-13 00:57:11,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:11,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114531097] [2021-10-13 00:57:11,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:11,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:11,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:11,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114531097] [2021-10-13 00:57:11,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114531097] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:11,577 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:11,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:11,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899732493] [2021-10-13 00:57:11,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:11,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:11,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:11,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:11,579 INFO L87 Difference]: Start difference. First operand 7429 states and 9475 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:11,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:11,793 INFO L93 Difference]: Finished difference Result 12297 states and 15749 transitions. [2021-10-13 00:57:11,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:11,794 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-10-13 00:57:11,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:11,818 INFO L225 Difference]: With dead ends: 12297 [2021-10-13 00:57:11,819 INFO L226 Difference]: Without dead ends: 12295 [2021-10-13 00:57:11,822 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12295 states. [2021-10-13 00:57:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12295 to 11269. [2021-10-13 00:57:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11269 states, 11268 states have (on average 1.238462903798367) internal successors, (13955), 11268 states have internal predecessors, (13955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 13955 transitions. [2021-10-13 00:57:12,207 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 13955 transitions. Word has length 25 [2021-10-13 00:57:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:12,207 INFO L470 AbstractCegarLoop]: Abstraction has 11269 states and 13955 transitions. [2021-10-13 00:57:12,207 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-10-13 00:57:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 13955 transitions. [2021-10-13 00:57:12,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 00:57:12,229 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:12,229 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:12,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 00:57:12,230 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:12,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:12,230 INFO L82 PathProgramCache]: Analyzing trace with hash -270697619, now seen corresponding path program 1 times [2021-10-13 00:57:12,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:12,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722484793] [2021-10-13 00:57:12,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:12,231 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:12,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:12,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722484793] [2021-10-13 00:57:12,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722484793] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:12,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:12,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:12,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244179905] [2021-10-13 00:57:12,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:12,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:12,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:12,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:12,263 INFO L87 Difference]: Start difference. First operand 11269 states and 13955 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:12,604 INFO L93 Difference]: Finished difference Result 25353 states and 31109 transitions. [2021-10-13 00:57:12,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:12,605 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-10-13 00:57:12,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:12,630 INFO L225 Difference]: With dead ends: 25353 [2021-10-13 00:57:12,631 INFO L226 Difference]: Without dead ends: 14343 [2021-10-13 00:57:12,642 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:12,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14343 states. [2021-10-13 00:57:13,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14343 to 14341. [2021-10-13 00:57:13,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14341 states, 14340 states have (on average 1.1963040446304045) internal successors, (17155), 14340 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14341 states to 14341 states and 17155 transitions. [2021-10-13 00:57:13,105 INFO L78 Accepts]: Start accepts. Automaton has 14341 states and 17155 transitions. Word has length 25 [2021-10-13 00:57:13,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:13,105 INFO L470 AbstractCegarLoop]: Abstraction has 14341 states and 17155 transitions. [2021-10-13 00:57:13,105 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-10-13 00:57:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 14341 states and 17155 transitions. [2021-10-13 00:57:13,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 00:57:13,129 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:13,130 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:13,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 00:57:13,130 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:13,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:13,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1209641729, now seen corresponding path program 1 times [2021-10-13 00:57:13,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:13,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611716938] [2021-10-13 00:57:13,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:13,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:13,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:13,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611716938] [2021-10-13 00:57:13,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611716938] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:13,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:13,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:13,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092155142] [2021-10-13 00:57:13,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:13,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:13,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:13,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:13,187 INFO L87 Difference]: Start difference. First operand 14341 states and 17155 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:13,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:13,491 INFO L93 Difference]: Finished difference Result 21513 states and 25605 transitions. [2021-10-13 00:57:13,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:13,492 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-10-13 00:57:13,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:13,518 INFO L225 Difference]: With dead ends: 21513 [2021-10-13 00:57:13,518 INFO L226 Difference]: Without dead ends: 14599 [2021-10-13 00:57:13,528 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:13,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14599 states. [2021-10-13 00:57:14,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14599 to 14597. [2021-10-13 00:57:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14597 states, 14596 states have (on average 1.175322006029049) internal successors, (17155), 14596 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14597 states to 14597 states and 17155 transitions. [2021-10-13 00:57:14,089 INFO L78 Accepts]: Start accepts. Automaton has 14597 states and 17155 transitions. Word has length 26 [2021-10-13 00:57:14,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:14,090 INFO L470 AbstractCegarLoop]: Abstraction has 14597 states and 17155 transitions. [2021-10-13 00:57:14,090 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-10-13 00:57:14,090 INFO L276 IsEmpty]: Start isEmpty. Operand 14597 states and 17155 transitions. [2021-10-13 00:57:14,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 00:57:14,115 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:14,115 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:14,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-13 00:57:14,116 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:14,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:14,117 INFO L82 PathProgramCache]: Analyzing trace with hash 198524479, now seen corresponding path program 1 times [2021-10-13 00:57:14,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:14,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495630278] [2021-10-13 00:57:14,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:14,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:14,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:14,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495630278] [2021-10-13 00:57:14,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495630278] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:14,148 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:14,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:14,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203031713] [2021-10-13 00:57:14,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:14,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:14,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:14,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:14,150 INFO L87 Difference]: Start difference. First operand 14597 states and 17155 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:14,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:14,627 INFO L93 Difference]: Finished difference Result 23559 states and 27396 transitions. [2021-10-13 00:57:14,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:14,627 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-10-13 00:57:14,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:14,671 INFO L225 Difference]: With dead ends: 23559 [2021-10-13 00:57:14,672 INFO L226 Difference]: Without dead ends: 23557 [2021-10-13 00:57:14,676 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:14,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23557 states. [2021-10-13 00:57:15,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23557 to 22533. [2021-10-13 00:57:15,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22533 states, 22532 states have (on average 1.1476566660749157) internal successors, (25859), 22532 states have internal predecessors, (25859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22533 states to 22533 states and 25859 transitions. [2021-10-13 00:57:15,310 INFO L78 Accepts]: Start accepts. Automaton has 22533 states and 25859 transitions. Word has length 26 [2021-10-13 00:57:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:15,311 INFO L470 AbstractCegarLoop]: Abstraction has 22533 states and 25859 transitions. [2021-10-13 00:57:15,311 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-10-13 00:57:15,311 INFO L276 IsEmpty]: Start isEmpty. Operand 22533 states and 25859 transitions. [2021-10-13 00:57:15,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 00:57:15,355 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:57:15,355 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:57:15,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-13 00:57:15,355 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:57:15,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:57:15,356 INFO L82 PathProgramCache]: Analyzing trace with hash -388281535, now seen corresponding path program 1 times [2021-10-13 00:57:15,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:57:15,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678917607] [2021-10-13 00:57:15,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:57:15,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:57:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:57:15,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:57:15,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:57:15,383 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678917607] [2021-10-13 00:57:15,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678917607] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:57:15,384 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:57:15,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:57:15,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281796780] [2021-10-13 00:57:15,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:57:15,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:57:15,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:57:15,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:15,386 INFO L87 Difference]: Start difference. First operand 22533 states and 25859 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:15,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:57:15,803 INFO L93 Difference]: Finished difference Result 50181 states and 56579 transitions. [2021-10-13 00:57:15,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:57:15,804 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-10-13 00:57:15,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:57:15,805 INFO L225 Difference]: With dead ends: 50181 [2021-10-13 00:57:15,805 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 00:57:15,843 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:57:15,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 00:57:15,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 00:57:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:57:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 00:57:15,844 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2021-10-13 00:57:15,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:57:15,845 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 00:57:15,845 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-10-13 00:57:15,845 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 00:57:15,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 00:57:15,849 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:57:15,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-13 00:57:15,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-13 00:57:15,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:57:15,869 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:57:15,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:57:15,873 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:57:15,881 INFO L857 garLoopResultBuilder]: For program point L126(line 126) no Hoare annotation was computed. [2021-10-13 00:57:15,882 INFO L857 garLoopResultBuilder]: For program point L151(line 151) no Hoare annotation was computed. [2021-10-13 00:57:15,882 INFO L857 garLoopResultBuilder]: For program point L110-1(lines 41 160) no Hoare annotation was computed. [2021-10-13 00:57:15,883 INFO L857 garLoopResultBuilder]: For program point L135-1(lines 41 160) no Hoare annotation was computed. [2021-10-13 00:57:15,883 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-13 00:57:15,883 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-13 00:57:15,884 INFO L857 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2021-10-13 00:57:15,884 INFO L857 garLoopResultBuilder]: For program point L136(line 136) no Hoare annotation was computed. [2021-10-13 00:57:15,884 INFO L860 garLoopResultBuilder]: At program point L161(lines 7 165) the Hoare annotation is: true [2021-10-13 00:57:15,885 INFO L857 garLoopResultBuilder]: For program point L120-1(lines 41 160) no Hoare annotation was computed. [2021-10-13 00:57:15,885 INFO L857 garLoopResultBuilder]: For program point L145-1(lines 41 160) no Hoare annotation was computed. [2021-10-13 00:57:15,885 INFO L857 garLoopResultBuilder]: For program point L104-1(lines 41 160) no Hoare annotation was computed. [2021-10-13 00:57:15,885 INFO L857 garLoopResultBuilder]: For program point L96-1(lines 41 160) no Hoare annotation was computed. [2021-10-13 00:57:15,885 INFO L857 garLoopResultBuilder]: For program point L121(line 121) no Hoare annotation was computed. [2021-10-13 00:57:15,886 INFO L857 garLoopResultBuilder]: For program point L88-1(lines 41 160) no Hoare annotation was computed. [2021-10-13 00:57:15,886 INFO L857 garLoopResultBuilder]: For program point L146(line 146) no Hoare annotation was computed. [2021-10-13 00:57:15,886 INFO L857 garLoopResultBuilder]: For program point L80-1(lines 41 160) no Hoare annotation was computed. [2021-10-13 00:57:15,886 INFO L857 garLoopResultBuilder]: For program point L72-1(lines 41 160) no Hoare annotation was computed. [2021-10-13 00:57:15,886 INFO L857 garLoopResultBuilder]: For program point L130-1(lines 41 160) no Hoare annotation was computed. [2021-10-13 00:57:15,887 INFO L860 garLoopResultBuilder]: At program point L155-1(lines 41 160) the Hoare annotation is: true [2021-10-13 00:57:15,887 INFO L860 garLoopResultBuilder]: At program point L164(lines 6 165) the Hoare annotation is: true [2021-10-13 00:57:15,887 INFO L857 garLoopResultBuilder]: For program point L131(line 131) no Hoare annotation was computed. [2021-10-13 00:57:15,887 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-13 00:57:15,887 INFO L857 garLoopResultBuilder]: For program point L156(line 156) no Hoare annotation was computed. [2021-10-13 00:57:15,888 INFO L853 garLoopResultBuilder]: At program point L156-1(lines 7 165) the Hoare annotation is: false [2021-10-13 00:57:15,888 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 163) no Hoare annotation was computed. [2021-10-13 00:57:15,888 INFO L857 garLoopResultBuilder]: For program point L115-1(lines 41 160) no Hoare annotation was computed. [2021-10-13 00:57:15,888 INFO L857 garLoopResultBuilder]: For program point L140-1(lines 41 160) no Hoare annotation was computed. [2021-10-13 00:57:15,889 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-13 00:57:15,889 INFO L857 garLoopResultBuilder]: For program point L116(line 116) no Hoare annotation was computed. [2021-10-13 00:57:15,889 INFO L857 garLoopResultBuilder]: For program point L141(line 141) no Hoare annotation was computed. [2021-10-13 00:57:15,889 INFO L857 garLoopResultBuilder]: For program point L100-1(lines 41 160) no Hoare annotation was computed. [2021-10-13 00:57:15,889 INFO L857 garLoopResultBuilder]: For program point L125-1(lines 41 160) no Hoare annotation was computed. [2021-10-13 00:57:15,890 INFO L857 garLoopResultBuilder]: For program point L92-1(lines 41 160) no Hoare annotation was computed. [2021-10-13 00:57:15,890 INFO L857 garLoopResultBuilder]: For program point L150-1(lines 41 160) no Hoare annotation was computed. [2021-10-13 00:57:15,890 INFO L857 garLoopResultBuilder]: For program point L84-1(lines 41 160) no Hoare annotation was computed. [2021-10-13 00:57:15,890 INFO L857 garLoopResultBuilder]: For program point L43(lines 43 45) no Hoare annotation was computed. [2021-10-13 00:57:15,890 INFO L857 garLoopResultBuilder]: For program point L76-1(lines 41 160) no Hoare annotation was computed. [2021-10-13 00:57:15,891 INFO L857 garLoopResultBuilder]: For program point L68(lines 68 70) no Hoare annotation was computed. [2021-10-13 00:57:15,891 INFO L857 garLoopResultBuilder]: For program point L68-2(lines 41 160) no Hoare annotation was computed. [2021-10-13 00:57:15,897 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:57:15,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:57:15 BoogieIcfgContainer [2021-10-13 00:57:15,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:57:15,914 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:57:15,914 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:57:15,914 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:57:15,915 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:57:06" (3/4) ... [2021-10-13 00:57:15,919 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 00:57:15,937 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-13 00:57:15,938 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-13 00:57:15,938 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 00:57:15,939 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 00:57:16,019 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a93aa655-67f5-4c63-92e6-77149bef3fc6/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:57:16,020 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:57:16,023 INFO L168 Benchmark]: Toolchain (without parser) took 10166.65 ms. Allocated memory was 100.7 MB in the beginning and 1.1 GB in the end (delta: 983.6 MB). Free memory was 58.0 MB in the beginning and 647.3 MB in the end (delta: -589.3 MB). Peak memory consumption was 395.3 MB. Max. memory is 16.1 GB. [2021-10-13 00:57:16,023 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 100.7 MB. Free memory is still 74.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:57:16,024 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.68 ms. Allocated memory is still 100.7 MB. Free memory was 57.8 MB in the beginning and 75.0 MB in the end (delta: -17.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 00:57:16,025 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.10 ms. Allocated memory is still 100.7 MB. Free memory was 75.0 MB in the beginning and 73.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:57:16,026 INFO L168 Benchmark]: Boogie Preprocessor took 62.49 ms. Allocated memory is still 100.7 MB. Free memory was 73.2 MB in the beginning and 72.2 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:57:16,026 INFO L168 Benchmark]: RCFGBuilder took 340.42 ms. Allocated memory is still 100.7 MB. Free memory was 71.9 MB in the beginning and 60.1 MB in the end (delta: 11.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:57:16,027 INFO L168 Benchmark]: TraceAbstraction took 9311.51 ms. Allocated memory was 100.7 MB in the beginning and 1.1 GB in the end (delta: 983.6 MB). Free memory was 59.6 MB in the beginning and 651.5 MB in the end (delta: -591.8 MB). Peak memory consumption was 393.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:57:16,027 INFO L168 Benchmark]: Witness Printer took 105.88 ms. Allocated memory is still 1.1 GB. Free memory was 651.5 MB in the beginning and 647.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:57:16,031 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 100.7 MB. Free memory is still 74.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 271.68 ms. Allocated memory is still 100.7 MB. Free memory was 57.8 MB in the beginning and 75.0 MB in the end (delta: -17.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 66.10 ms. Allocated memory is still 100.7 MB. Free memory was 75.0 MB in the beginning and 73.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 62.49 ms. Allocated memory is still 100.7 MB. Free memory was 73.2 MB in the beginning and 72.2 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 340.42 ms. Allocated memory is still 100.7 MB. Free memory was 71.9 MB in the beginning and 60.1 MB in the end (delta: 11.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9311.51 ms. Allocated memory was 100.7 MB in the beginning and 1.1 GB in the end (delta: 983.6 MB). Free memory was 59.6 MB in the beginning and 651.5 MB in the end (delta: -591.8 MB). Peak memory consumption was 393.1 MB. Max. memory is 16.1 GB. * Witness Printer took 105.88 ms. Allocated memory is still 1.1 GB. Free memory was 651.5 MB in the beginning and 647.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 163]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9239.5ms, OverallIterations: 28, TraceHistogramMax: 1, EmptinessCheckTime: 242.9ms, AutomataDifference: 3491.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 30.1ms, InitialAbstractionConstructionTime: 10.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2304 SDtfs, 1149 SDslu, 1533 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 233.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 94.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=22533occurred in iteration=27, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3764.6ms AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 1033 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 12.3ms HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 3.3ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 91.7ms SsaConstructionTime, 307.8ms SatisfiabilityAnalysisTime, 909.1ms InterpolantComputationTime, 608 NumberOfCodeBlocks, 608 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 580 ConstructedInterpolants, 0 QuantifiedInterpolants, 1240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-10-13 00:57:16,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a93aa655-67f5-4c63-92e6-77149bef3fc6/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...