./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/bin/uautomizer-GMMbpWq8iD/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_9.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/bin/uautomizer-GMMbpWq8iD --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 22:47:02,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 22:47:02,977 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 22:47:03,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 22:47:03,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 22:47:03,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 22:47:03,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 22:47:03,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 22:47:03,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 22:47:03,081 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 22:47:03,083 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 22:47:03,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 22:47:03,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 22:47:03,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 22:47:03,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 22:47:03,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 22:47:03,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 22:47:03,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 22:47:03,108 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 22:47:03,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 22:47:03,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 22:47:03,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 22:47:03,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 22:47:03,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 22:47:03,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 22:47:03,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 22:47:03,139 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 22:47:03,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 22:47:03,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 22:47:03,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 22:47:03,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 22:47:03,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 22:47:03,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 22:47:03,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 22:47:03,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 22:47:03,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 22:47:03,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 22:47:03,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 22:47:03,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 22:47:03,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 22:47:03,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 22:47:03,156 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 22:47:03,210 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 22:47:03,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 22:47:03,211 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 22:47:03,211 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 22:47:03,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 22:47:03,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 22:47:03,221 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 22:47:03,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 22:47:03,221 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 22:47:03,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 22:47:03,222 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 22:47:03,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 22:47:03,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 22:47:03,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 22:47:03,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 22:47:03,224 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 22:47:03,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 22:47:03,224 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 22:47:03,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 22:47:03,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 22:47:03,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 22:47:03,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 22:47:03,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 22:47:03,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 22:47:03,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 22:47:03,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 22:47:03,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 22:47:03,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 22:47:03,228 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 22:47:03,228 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 22:47:03,228 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 22:47:03,228 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 22:47:03,229 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_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/bin/uautomizer-GMMbpWq8iD/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_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/bin/uautomizer-GMMbpWq8iD Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2021-10-28 22:47:03,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 22:47:03,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 22:47:03,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 22:47:03,643 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 22:47:03,645 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 22:47:03,647 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/locks/test_locks_9.c [2021-10-28 22:47:03,727 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/bin/uautomizer-GMMbpWq8iD/data/a00cf1b48/47f11820e5254105b0b02a9b4c909f8e/FLAGef7922a4d [2021-10-28 22:47:04,305 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 22:47:04,306 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/sv-benchmarks/c/locks/test_locks_9.c [2021-10-28 22:47:04,315 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/bin/uautomizer-GMMbpWq8iD/data/a00cf1b48/47f11820e5254105b0b02a9b4c909f8e/FLAGef7922a4d [2021-10-28 22:47:04,650 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/bin/uautomizer-GMMbpWq8iD/data/a00cf1b48/47f11820e5254105b0b02a9b4c909f8e [2021-10-28 22:47:04,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 22:47:04,655 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 22:47:04,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 22:47:04,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 22:47:04,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 22:47:04,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 10:47:04" (1/1) ... [2021-10-28 22:47:04,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3852b9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:47:04, skipping insertion in model container [2021-10-28 22:47:04,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 10:47:04" (1/1) ... [2021-10-28 22:47:04,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 22:47:04,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 22:47:04,914 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_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2021-10-28 22:47:04,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 22:47:04,940 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 22:47:04,968 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_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2021-10-28 22:47:04,970 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 22:47:04,984 INFO L208 MainTranslator]: Completed translation [2021-10-28 22:47:04,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:47:04 WrapperNode [2021-10-28 22:47:04,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 22:47:04,987 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 22:47:04,987 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 22:47:04,987 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 22:47:04,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:47:04" (1/1) ... [2021-10-28 22:47:05,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:47:04" (1/1) ... [2021-10-28 22:47:05,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 22:47:05,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 22:47:05,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 22:47:05,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 22:47:05,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:47:04" (1/1) ... [2021-10-28 22:47:05,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:47:04" (1/1) ... [2021-10-28 22:47:05,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:47:04" (1/1) ... [2021-10-28 22:47:05,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:47:04" (1/1) ... [2021-10-28 22:47:05,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:47:04" (1/1) ... [2021-10-28 22:47:05,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:47:04" (1/1) ... [2021-10-28 22:47:05,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:47:04" (1/1) ... [2021-10-28 22:47:05,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 22:47:05,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 22:47:05,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 22:47:05,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 22:47:05,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:47:04" (1/1) ... [2021-10-28 22:47:05,095 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 22:47:05,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 22:47:05,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 22:47:05,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 22:47:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 22:47:05,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 22:47:05,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 22:47:05,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 22:47:05,466 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 22:47:05,466 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-28 22:47:05,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:47:05 BoogieIcfgContainer [2021-10-28 22:47:05,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 22:47:05,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 22:47:05,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 22:47:05,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 22:47:05,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 10:47:04" (1/3) ... [2021-10-28 22:47:05,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4263737d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 10:47:05, skipping insertion in model container [2021-10-28 22:47:05,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:47:04" (2/3) ... [2021-10-28 22:47:05,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4263737d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 10:47:05, skipping insertion in model container [2021-10-28 22:47:05,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:47:05" (3/3) ... [2021-10-28 22:47:05,479 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2021-10-28 22:47:05,486 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 22:47:05,487 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-28 22:47:05,561 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 22:47:05,569 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 22:47:05,580 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-28 22:47:05,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-28 22:47:05,635 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:05,635 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:05,636 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:05,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:05,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1657621241, now seen corresponding path program 1 times [2021-10-28 22:47:05,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:05,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183141784] [2021-10-28 22:47:05,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:05,672 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:06,042 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-28 22:47:06,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:06,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183141784] [2021-10-28 22:47:06,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183141784] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:06,045 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:06,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:06,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706470969] [2021-10-28 22:47:06,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:06,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:06,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:06,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:06,079 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:06,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:06,150 INFO L93 Difference]: Finished difference Result 77 states and 133 transitions. [2021-10-28 22:47:06,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:06,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-28 22:47:06,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:06,167 INFO L225 Difference]: With dead ends: 77 [2021-10-28 22:47:06,167 INFO L226 Difference]: Without dead ends: 63 [2021-10-28 22:47:06,172 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:06,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-10-28 22:47:06,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 43. [2021-10-28 22:47:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:06,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 78 transitions. [2021-10-28 22:47:06,232 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 78 transitions. Word has length 16 [2021-10-28 22:47:06,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:06,234 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 78 transitions. [2021-10-28 22:47:06,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:06,235 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 78 transitions. [2021-10-28 22:47:06,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-28 22:47:06,237 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:06,238 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:06,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 22:47:06,239 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:06,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:06,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1399455803, now seen corresponding path program 1 times [2021-10-28 22:47:06,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:06,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921501749] [2021-10-28 22:47:06,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:06,247 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:06,343 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-28 22:47:06,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:06,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921501749] [2021-10-28 22:47:06,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921501749] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:06,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:06,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:06,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691186175] [2021-10-28 22:47:06,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:06,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:06,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:06,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:06,349 INFO L87 Difference]: Start difference. First operand 43 states and 78 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:06,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:06,379 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2021-10-28 22:47:06,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:06,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-28 22:47:06,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:06,383 INFO L225 Difference]: With dead ends: 104 [2021-10-28 22:47:06,384 INFO L226 Difference]: Without dead ends: 63 [2021-10-28 22:47:06,386 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-10-28 22:47:06,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2021-10-28 22:47:06,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:06,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 110 transitions. [2021-10-28 22:47:06,403 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 110 transitions. Word has length 16 [2021-10-28 22:47:06,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:06,405 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 110 transitions. [2021-10-28 22:47:06,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:06,406 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 110 transitions. [2021-10-28 22:47:06,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-28 22:47:06,409 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:06,410 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:06,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 22:47:06,411 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:06,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:06,412 INFO L85 PathProgramCache]: Analyzing trace with hash 153562753, now seen corresponding path program 1 times [2021-10-28 22:47:06,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:06,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356294874] [2021-10-28 22:47:06,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:06,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:06,522 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-28 22:47:06,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:06,524 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356294874] [2021-10-28 22:47:06,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356294874] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:06,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:06,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:06,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882998659] [2021-10-28 22:47:06,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:06,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:06,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:06,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:06,531 INFO L87 Difference]: Start difference. First operand 61 states and 110 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:06,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:06,589 INFO L93 Difference]: Finished difference Result 96 states and 168 transitions. [2021-10-28 22:47:06,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:06,599 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-28 22:47:06,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:06,601 INFO L225 Difference]: With dead ends: 96 [2021-10-28 22:47:06,601 INFO L226 Difference]: Without dead ends: 66 [2021-10-28 22:47:06,601 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:06,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-10-28 22:47:06,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2021-10-28 22:47:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:06,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions. [2021-10-28 22:47:06,627 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 17 [2021-10-28 22:47:06,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:06,627 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 112 transitions. [2021-10-28 22:47:06,629 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-28 22:47:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 112 transitions. [2021-10-28 22:47:06,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-28 22:47:06,631 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:06,631 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:06,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 22:47:06,632 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:06,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:06,633 INFO L85 PathProgramCache]: Analyzing trace with hash -433243261, now seen corresponding path program 1 times [2021-10-28 22:47:06,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:06,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651320450] [2021-10-28 22:47:06,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:06,634 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:47:06,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:06,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651320450] [2021-10-28 22:47:06,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651320450] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:06,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:06,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:06,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862348096] [2021-10-28 22:47:06,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:06,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:06,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:06,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:06,749 INFO L87 Difference]: Start difference. First operand 64 states and 112 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:06,769 INFO L93 Difference]: Finished difference Result 121 states and 213 transitions. [2021-10-28 22:47:06,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:06,770 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-28 22:47:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:06,772 INFO L225 Difference]: With dead ends: 121 [2021-10-28 22:47:06,772 INFO L226 Difference]: Without dead ends: 119 [2021-10-28 22:47:06,773 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-10-28 22:47:06,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 85. [2021-10-28 22:47:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 149 transitions. [2021-10-28 22:47:06,786 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 149 transitions. Word has length 17 [2021-10-28 22:47:06,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:06,787 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 149 transitions. [2021-10-28 22:47:06,787 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-28 22:47:06,787 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 149 transitions. [2021-10-28 22:47:06,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-28 22:47:06,789 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:06,789 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:06,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 22:47:06,789 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:06,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:06,790 INFO L85 PathProgramCache]: Analyzing trace with hash -175077823, now seen corresponding path program 1 times [2021-10-28 22:47:06,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:06,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106280596] [2021-10-28 22:47:06,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:06,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:06,835 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-28 22:47:06,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:06,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106280596] [2021-10-28 22:47:06,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106280596] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:06,836 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:06,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:06,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619821191] [2021-10-28 22:47:06,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:06,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:06,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:06,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:06,839 INFO L87 Difference]: Start difference. First operand 85 states and 149 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:06,860 INFO L93 Difference]: Finished difference Result 201 states and 355 transitions. [2021-10-28 22:47:06,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:06,860 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-28 22:47:06,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:06,862 INFO L225 Difference]: With dead ends: 201 [2021-10-28 22:47:06,862 INFO L226 Difference]: Without dead ends: 121 [2021-10-28 22:47:06,863 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:06,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-10-28 22:47:06,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2021-10-28 22:47:06,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:06,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 207 transitions. [2021-10-28 22:47:06,877 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 207 transitions. Word has length 17 [2021-10-28 22:47:06,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:06,877 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 207 transitions. [2021-10-28 22:47:06,878 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-28 22:47:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 207 transitions. [2021-10-28 22:47:06,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-28 22:47:06,879 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:06,879 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:06,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 22:47:06,880 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:06,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:06,881 INFO L85 PathProgramCache]: Analyzing trace with hash -545425190, now seen corresponding path program 1 times [2021-10-28 22:47:06,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:06,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458655699] [2021-10-28 22:47:06,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:06,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:06,933 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-28 22:47:06,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:06,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458655699] [2021-10-28 22:47:06,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458655699] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:06,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:06,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:06,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911296245] [2021-10-28 22:47:06,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:06,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:06,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:06,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:06,937 INFO L87 Difference]: Start difference. First operand 119 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:06,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:06,968 INFO L93 Difference]: Finished difference Result 180 states and 310 transitions. [2021-10-28 22:47:06,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:06,968 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-28 22:47:06,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:06,970 INFO L225 Difference]: With dead ends: 180 [2021-10-28 22:47:06,970 INFO L226 Difference]: Without dead ends: 123 [2021-10-28 22:47:06,971 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:06,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-10-28 22:47:06,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2021-10-28 22:47:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 207 transitions. [2021-10-28 22:47:06,989 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 207 transitions. Word has length 18 [2021-10-28 22:47:06,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:06,990 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 207 transitions. [2021-10-28 22:47:06,991 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-28 22:47:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 207 transitions. [2021-10-28 22:47:06,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-28 22:47:06,996 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:06,996 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:06,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 22:47:06,996 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:06,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:06,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1132231204, now seen corresponding path program 1 times [2021-10-28 22:47:06,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:07,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840447651] [2021-10-28 22:47:07,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:07,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:07,089 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-28 22:47:07,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:07,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840447651] [2021-10-28 22:47:07,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840447651] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:07,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:07,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:07,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113525055] [2021-10-28 22:47:07,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:07,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:07,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:07,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:07,093 INFO L87 Difference]: Start difference. First operand 121 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:07,134 INFO L93 Difference]: Finished difference Result 345 states and 593 transitions. [2021-10-28 22:47:07,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:07,134 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-28 22:47:07,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:07,137 INFO L225 Difference]: With dead ends: 345 [2021-10-28 22:47:07,138 INFO L226 Difference]: Without dead ends: 231 [2021-10-28 22:47:07,139 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:07,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-10-28 22:47:07,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2021-10-28 22:47:07,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6973684210526316) internal successors, (387), 228 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 387 transitions. [2021-10-28 22:47:07,163 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 387 transitions. Word has length 18 [2021-10-28 22:47:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:07,163 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 387 transitions. [2021-10-28 22:47:07,164 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-28 22:47:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 387 transitions. [2021-10-28 22:47:07,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-28 22:47:07,166 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:07,166 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:07,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 22:47:07,167 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:07,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:07,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1390396642, now seen corresponding path program 1 times [2021-10-28 22:47:07,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:07,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331891682] [2021-10-28 22:47:07,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:07,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:07,218 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-28 22:47:07,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:07,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331891682] [2021-10-28 22:47:07,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331891682] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:07,219 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:07,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:07,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001956799] [2021-10-28 22:47:07,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:07,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:07,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:07,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:07,222 INFO L87 Difference]: Start difference. First operand 229 states and 387 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:07,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:07,259 INFO L93 Difference]: Finished difference Result 289 states and 493 transitions. [2021-10-28 22:47:07,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:07,261 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-28 22:47:07,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:07,264 INFO L225 Difference]: With dead ends: 289 [2021-10-28 22:47:07,264 INFO L226 Difference]: Without dead ends: 287 [2021-10-28 22:47:07,265 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-10-28 22:47:07,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 229. [2021-10-28 22:47:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:07,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 383 transitions. [2021-10-28 22:47:07,296 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 383 transitions. Word has length 18 [2021-10-28 22:47:07,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:07,296 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 383 transitions. [2021-10-28 22:47:07,297 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-28 22:47:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 383 transitions. [2021-10-28 22:47:07,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 22:47:07,310 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:07,310 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:07,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 22:47:07,311 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:07,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:07,312 INFO L85 PathProgramCache]: Analyzing trace with hash -739214602, now seen corresponding path program 1 times [2021-10-28 22:47:07,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:07,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512647474] [2021-10-28 22:47:07,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:07,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:07,345 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-28 22:47:07,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:07,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512647474] [2021-10-28 22:47:07,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512647474] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:07,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:07,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:07,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698431111] [2021-10-28 22:47:07,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:07,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:07,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:07,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:07,348 INFO L87 Difference]: Start difference. First operand 229 states and 383 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:07,368 INFO L93 Difference]: Finished difference Result 421 states and 713 transitions. [2021-10-28 22:47:07,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:07,369 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-28 22:47:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:07,373 INFO L225 Difference]: With dead ends: 421 [2021-10-28 22:47:07,373 INFO L226 Difference]: Without dead ends: 419 [2021-10-28 22:47:07,374 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-10-28 22:47:07,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 321. [2021-10-28 22:47:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 1.646875) internal successors, (527), 320 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:07,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 527 transitions. [2021-10-28 22:47:07,411 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 527 transitions. Word has length 19 [2021-10-28 22:47:07,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:07,430 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 527 transitions. [2021-10-28 22:47:07,431 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-28 22:47:07,431 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 527 transitions. [2021-10-28 22:47:07,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 22:47:07,433 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:07,433 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:07,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 22:47:07,434 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:07,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:07,435 INFO L85 PathProgramCache]: Analyzing trace with hash -481049164, now seen corresponding path program 1 times [2021-10-28 22:47:07,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:07,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671345476] [2021-10-28 22:47:07,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:07,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:07,499 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-28 22:47:07,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:07,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671345476] [2021-10-28 22:47:07,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671345476] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:07,501 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:07,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:07,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677180012] [2021-10-28 22:47:07,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:07,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:07,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:07,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:07,503 INFO L87 Difference]: Start difference. First operand 321 states and 527 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:07,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:07,533 INFO L93 Difference]: Finished difference Result 757 states and 1249 transitions. [2021-10-28 22:47:07,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:07,534 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-28 22:47:07,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:07,537 INFO L225 Difference]: With dead ends: 757 [2021-10-28 22:47:07,538 INFO L226 Difference]: Without dead ends: 443 [2021-10-28 22:47:07,539 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:07,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-10-28 22:47:07,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2021-10-28 22:47:07,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.625) internal successors, (715), 440 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 715 transitions. [2021-10-28 22:47:07,566 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 715 transitions. Word has length 19 [2021-10-28 22:47:07,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:07,567 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 715 transitions. [2021-10-28 22:47:07,567 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-28 22:47:07,567 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 715 transitions. [2021-10-28 22:47:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-28 22:47:07,569 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:07,569 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:07,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 22:47:07,570 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:07,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:07,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1440601487, now seen corresponding path program 1 times [2021-10-28 22:47:07,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:07,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566493101] [2021-10-28 22:47:07,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:07,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:07,622 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-28 22:47:07,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:07,623 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566493101] [2021-10-28 22:47:07,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566493101] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:07,623 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:07,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:07,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071124138] [2021-10-28 22:47:07,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:07,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:07,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:07,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:07,626 INFO L87 Difference]: Start difference. First operand 441 states and 715 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:07,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:07,674 INFO L93 Difference]: Finished difference Result 669 states and 1081 transitions. [2021-10-28 22:47:07,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:07,674 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-28 22:47:07,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:07,678 INFO L225 Difference]: With dead ends: 669 [2021-10-28 22:47:07,679 INFO L226 Difference]: Without dead ends: 455 [2021-10-28 22:47:07,680 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:07,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2021-10-28 22:47:07,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 453. [2021-10-28 22:47:07,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.5995575221238938) internal successors, (723), 452 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 723 transitions. [2021-10-28 22:47:07,705 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 723 transitions. Word has length 20 [2021-10-28 22:47:07,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:07,706 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 723 transitions. [2021-10-28 22:47:07,706 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-28 22:47:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 723 transitions. [2021-10-28 22:47:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-28 22:47:07,708 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:07,708 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:07,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 22:47:07,708 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:07,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:07,715 INFO L85 PathProgramCache]: Analyzing trace with hash -2027407501, now seen corresponding path program 1 times [2021-10-28 22:47:07,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:07,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247346937] [2021-10-28 22:47:07,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:07,716 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:47:07,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:07,769 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247346937] [2021-10-28 22:47:07,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247346937] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:07,769 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:07,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:07,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884200555] [2021-10-28 22:47:07,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:07,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:07,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:07,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:07,771 INFO L87 Difference]: Start difference. First operand 453 states and 723 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:07,816 INFO L93 Difference]: Finished difference Result 809 states and 1309 transitions. [2021-10-28 22:47:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:07,817 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-28 22:47:07,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:07,832 INFO L225 Difference]: With dead ends: 809 [2021-10-28 22:47:07,834 INFO L226 Difference]: Without dead ends: 807 [2021-10-28 22:47:07,843 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:07,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2021-10-28 22:47:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 645. [2021-10-28 22:47:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.5574534161490683) internal successors, (1003), 644 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1003 transitions. [2021-10-28 22:47:07,882 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1003 transitions. Word has length 20 [2021-10-28 22:47:07,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:07,883 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 1003 transitions. [2021-10-28 22:47:07,883 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-28 22:47:07,883 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1003 transitions. [2021-10-28 22:47:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-28 22:47:07,885 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:07,885 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:07,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 22:47:07,885 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:07,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:07,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1769242063, now seen corresponding path program 1 times [2021-10-28 22:47:07,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:07,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939996796] [2021-10-28 22:47:07,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:07,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:07,921 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-28 22:47:07,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:07,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939996796] [2021-10-28 22:47:07,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939996796] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:07,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:07,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:07,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332288176] [2021-10-28 22:47:07,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:07,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:07,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:07,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:07,924 INFO L87 Difference]: Start difference. First operand 645 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:07,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:07,956 INFO L93 Difference]: Finished difference Result 1497 states and 2333 transitions. [2021-10-28 22:47:07,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:07,957 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-28 22:47:07,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:07,963 INFO L225 Difference]: With dead ends: 1497 [2021-10-28 22:47:07,964 INFO L226 Difference]: Without dead ends: 871 [2021-10-28 22:47:07,965 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:07,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2021-10-28 22:47:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2021-10-28 22:47:08,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.5334101382488479) internal successors, (1331), 868 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1331 transitions. [2021-10-28 22:47:08,018 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1331 transitions. Word has length 20 [2021-10-28 22:47:08,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:08,019 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 1331 transitions. [2021-10-28 22:47:08,019 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-28 22:47:08,020 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1331 transitions. [2021-10-28 22:47:08,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-28 22:47:08,023 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:08,024 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:08,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 22:47:08,024 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:08,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:08,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1575091945, now seen corresponding path program 1 times [2021-10-28 22:47:08,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:08,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905245922] [2021-10-28 22:47:08,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:08,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:08,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:47:08,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:08,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905245922] [2021-10-28 22:47:08,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905245922] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:08,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:08,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:08,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135014069] [2021-10-28 22:47:08,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:08,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:08,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:08,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:08,076 INFO L87 Difference]: Start difference. First operand 869 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:08,124 INFO L93 Difference]: Finished difference Result 1305 states and 1989 transitions. [2021-10-28 22:47:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:08,125 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-28 22:47:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:08,132 INFO L225 Difference]: With dead ends: 1305 [2021-10-28 22:47:08,133 INFO L226 Difference]: Without dead ends: 887 [2021-10-28 22:47:08,135 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:08,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2021-10-28 22:47:08,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2021-10-28 22:47:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:08,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1331 transitions. [2021-10-28 22:47:08,171 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1331 transitions. Word has length 21 [2021-10-28 22:47:08,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:08,171 INFO L470 AbstractCegarLoop]: Abstraction has 885 states and 1331 transitions. [2021-10-28 22:47:08,172 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-28 22:47:08,172 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1331 transitions. [2021-10-28 22:47:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-28 22:47:08,174 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:08,174 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:08,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 22:47:08,175 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:08,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:08,175 INFO L85 PathProgramCache]: Analyzing trace with hash 988285931, now seen corresponding path program 1 times [2021-10-28 22:47:08,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:08,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875991946] [2021-10-28 22:47:08,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:08,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:08,222 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-28 22:47:08,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:08,222 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875991946] [2021-10-28 22:47:08,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875991946] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:08,223 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:08,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:08,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564740154] [2021-10-28 22:47:08,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:08,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:08,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:08,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:08,225 INFO L87 Difference]: Start difference. First operand 885 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:08,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:08,264 INFO L93 Difference]: Finished difference Result 1545 states and 2357 transitions. [2021-10-28 22:47:08,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:08,265 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-28 22:47:08,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:08,277 INFO L225 Difference]: With dead ends: 1545 [2021-10-28 22:47:08,277 INFO L226 Difference]: Without dead ends: 1543 [2021-10-28 22:47:08,280 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2021-10-28 22:47:08,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1285. [2021-10-28 22:47:08,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:08,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1875 transitions. [2021-10-28 22:47:08,333 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1875 transitions. Word has length 21 [2021-10-28 22:47:08,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:08,335 INFO L470 AbstractCegarLoop]: Abstraction has 1285 states and 1875 transitions. [2021-10-28 22:47:08,335 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-28 22:47:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1875 transitions. [2021-10-28 22:47:08,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-28 22:47:08,338 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:08,338 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:08,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 22:47:08,342 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:08,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:08,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1246451369, now seen corresponding path program 1 times [2021-10-28 22:47:08,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:08,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856892551] [2021-10-28 22:47:08,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:08,343 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:08,404 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-28 22:47:08,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:08,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856892551] [2021-10-28 22:47:08,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856892551] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:08,405 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:08,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:08,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843266243] [2021-10-28 22:47:08,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:08,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:08,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:08,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:08,411 INFO L87 Difference]: Start difference. First operand 1285 states and 1875 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:08,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:08,459 INFO L93 Difference]: Finished difference Result 2953 states and 4309 transitions. [2021-10-28 22:47:08,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:08,460 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-28 22:47:08,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:08,471 INFO L225 Difference]: With dead ends: 2953 [2021-10-28 22:47:08,472 INFO L226 Difference]: Without dead ends: 1703 [2021-10-28 22:47:08,474 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:08,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2021-10-28 22:47:08,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1701. [2021-10-28 22:47:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2435 transitions. [2021-10-28 22:47:08,573 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2435 transitions. Word has length 21 [2021-10-28 22:47:08,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:08,574 INFO L470 AbstractCegarLoop]: Abstraction has 1701 states and 2435 transitions. [2021-10-28 22:47:08,574 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-28 22:47:08,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2435 transitions. [2021-10-28 22:47:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-28 22:47:08,577 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:08,578 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:08,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 22:47:08,578 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:08,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:08,579 INFO L85 PathProgramCache]: Analyzing trace with hash 572308166, now seen corresponding path program 1 times [2021-10-28 22:47:08,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:08,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58729431] [2021-10-28 22:47:08,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:08,581 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:08,625 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-28 22:47:08,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:08,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58729431] [2021-10-28 22:47:08,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58729431] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:08,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:08,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:08,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923141111] [2021-10-28 22:47:08,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:08,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:08,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:08,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:08,629 INFO L87 Difference]: Start difference. First operand 1701 states and 2435 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:08,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:08,678 INFO L93 Difference]: Finished difference Result 2553 states and 3637 transitions. [2021-10-28 22:47:08,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:08,679 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-28 22:47:08,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:08,691 INFO L225 Difference]: With dead ends: 2553 [2021-10-28 22:47:08,691 INFO L226 Difference]: Without dead ends: 1735 [2021-10-28 22:47:08,696 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:08,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2021-10-28 22:47:08,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1733. [2021-10-28 22:47:08,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:08,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2435 transitions. [2021-10-28 22:47:08,772 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2435 transitions. Word has length 22 [2021-10-28 22:47:08,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:08,773 INFO L470 AbstractCegarLoop]: Abstraction has 1733 states and 2435 transitions. [2021-10-28 22:47:08,773 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-28 22:47:08,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2435 transitions. [2021-10-28 22:47:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-28 22:47:08,777 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:08,777 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:08,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 22:47:08,778 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:08,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:08,779 INFO L85 PathProgramCache]: Analyzing trace with hash -14497848, now seen corresponding path program 1 times [2021-10-28 22:47:08,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:08,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725007200] [2021-10-28 22:47:08,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:08,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:08,822 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-28 22:47:08,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:08,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725007200] [2021-10-28 22:47:08,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725007200] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:08,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:08,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:08,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947710374] [2021-10-28 22:47:08,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:08,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:08,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:08,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:08,825 INFO L87 Difference]: Start difference. First operand 1733 states and 2435 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:08,892 INFO L93 Difference]: Finished difference Result 2953 states and 4197 transitions. [2021-10-28 22:47:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:08,893 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-28 22:47:08,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:08,913 INFO L225 Difference]: With dead ends: 2953 [2021-10-28 22:47:08,913 INFO L226 Difference]: Without dead ends: 2951 [2021-10-28 22:47:08,914 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:08,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2021-10-28 22:47:08,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2565. [2021-10-28 22:47:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:09,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3491 transitions. [2021-10-28 22:47:09,045 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3491 transitions. Word has length 22 [2021-10-28 22:47:09,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:09,046 INFO L470 AbstractCegarLoop]: Abstraction has 2565 states and 3491 transitions. [2021-10-28 22:47:09,046 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-28 22:47:09,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3491 transitions. [2021-10-28 22:47:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-28 22:47:09,051 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:09,051 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:09,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 22:47:09,052 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:09,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:09,052 INFO L85 PathProgramCache]: Analyzing trace with hash 243667590, now seen corresponding path program 1 times [2021-10-28 22:47:09,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:09,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923870767] [2021-10-28 22:47:09,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:09,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:09,090 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-28 22:47:09,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:09,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923870767] [2021-10-28 22:47:09,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923870767] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:09,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:09,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:09,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522293521] [2021-10-28 22:47:09,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:09,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:09,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:09,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:09,095 INFO L87 Difference]: Start difference. First operand 2565 states and 3491 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:09,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:09,160 INFO L93 Difference]: Finished difference Result 5833 states and 7909 transitions. [2021-10-28 22:47:09,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:09,160 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-28 22:47:09,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:09,178 INFO L225 Difference]: With dead ends: 5833 [2021-10-28 22:47:09,178 INFO L226 Difference]: Without dead ends: 3335 [2021-10-28 22:47:09,181 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:09,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2021-10-28 22:47:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3333. [2021-10-28 22:47:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4419 transitions. [2021-10-28 22:47:09,291 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4419 transitions. Word has length 22 [2021-10-28 22:47:09,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:09,292 INFO L470 AbstractCegarLoop]: Abstraction has 3333 states and 4419 transitions. [2021-10-28 22:47:09,292 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-28 22:47:09,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4419 transitions. [2021-10-28 22:47:09,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-28 22:47:09,297 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:09,297 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:09,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 22:47:09,298 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:09,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:09,298 INFO L85 PathProgramCache]: Analyzing trace with hash -449217570, now seen corresponding path program 1 times [2021-10-28 22:47:09,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:09,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915944315] [2021-10-28 22:47:09,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:09,299 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:09,325 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-28 22:47:09,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:09,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915944315] [2021-10-28 22:47:09,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915944315] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:09,327 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:09,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:09,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887105753] [2021-10-28 22:47:09,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:09,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:09,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:09,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:09,331 INFO L87 Difference]: Start difference. First operand 3333 states and 4419 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:09,432 INFO L93 Difference]: Finished difference Result 5001 states and 6597 transitions. [2021-10-28 22:47:09,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:09,432 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-28 22:47:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:09,451 INFO L225 Difference]: With dead ends: 5001 [2021-10-28 22:47:09,451 INFO L226 Difference]: Without dead ends: 3399 [2021-10-28 22:47:09,454 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2021-10-28 22:47:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3397. [2021-10-28 22:47:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:09,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4419 transitions. [2021-10-28 22:47:09,586 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4419 transitions. Word has length 23 [2021-10-28 22:47:09,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:09,586 INFO L470 AbstractCegarLoop]: Abstraction has 3397 states and 4419 transitions. [2021-10-28 22:47:09,586 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-28 22:47:09,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4419 transitions. [2021-10-28 22:47:09,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-28 22:47:09,591 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:09,591 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:09,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-28 22:47:09,591 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:09,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:09,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1036023584, now seen corresponding path program 1 times [2021-10-28 22:47:09,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:09,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465868443] [2021-10-28 22:47:09,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:09,593 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:09,617 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-28 22:47:09,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:09,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465868443] [2021-10-28 22:47:09,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465868443] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:09,617 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:09,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:09,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690509413] [2021-10-28 22:47:09,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:09,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:09,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:09,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:09,620 INFO L87 Difference]: Start difference. First operand 3397 states and 4419 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:09,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:09,731 INFO L93 Difference]: Finished difference Result 5641 states and 7365 transitions. [2021-10-28 22:47:09,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:09,732 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-28 22:47:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:09,781 INFO L225 Difference]: With dead ends: 5641 [2021-10-28 22:47:09,781 INFO L226 Difference]: Without dead ends: 5639 [2021-10-28 22:47:09,783 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:09,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2021-10-28 22:47:09,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5125. [2021-10-28 22:47:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 6467 transitions. [2021-10-28 22:47:09,954 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 6467 transitions. Word has length 23 [2021-10-28 22:47:09,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:09,954 INFO L470 AbstractCegarLoop]: Abstraction has 5125 states and 6467 transitions. [2021-10-28 22:47:09,954 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-28 22:47:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 6467 transitions. [2021-10-28 22:47:09,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-28 22:47:09,964 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:09,965 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:09,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-28 22:47:09,965 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:09,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash -777858146, now seen corresponding path program 1 times [2021-10-28 22:47:09,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:09,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360212826] [2021-10-28 22:47:09,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:09,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:10,000 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-28 22:47:10,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:10,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360212826] [2021-10-28 22:47:10,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360212826] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:10,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:10,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:10,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844768278] [2021-10-28 22:47:10,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:10,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:10,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:10,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:10,004 INFO L87 Difference]: Start difference. First operand 5125 states and 6467 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:10,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:10,123 INFO L93 Difference]: Finished difference Result 11529 states and 14405 transitions. [2021-10-28 22:47:10,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:10,123 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-28 22:47:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:10,136 INFO L225 Difference]: With dead ends: 11529 [2021-10-28 22:47:10,136 INFO L226 Difference]: Without dead ends: 6535 [2021-10-28 22:47:10,143 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:10,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2021-10-28 22:47:10,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 6533. [2021-10-28 22:47:10,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:10,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 7939 transitions. [2021-10-28 22:47:10,393 INFO L78 Accepts]: Start accepts. Automaton has 6533 states and 7939 transitions. Word has length 23 [2021-10-28 22:47:10,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:10,394 INFO L470 AbstractCegarLoop]: Abstraction has 6533 states and 7939 transitions. [2021-10-28 22:47:10,395 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-28 22:47:10,395 INFO L276 IsEmpty]: Start isEmpty. Operand 6533 states and 7939 transitions. [2021-10-28 22:47:10,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-28 22:47:10,403 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:10,403 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:10,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-28 22:47:10,404 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:10,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:10,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2051743973, now seen corresponding path program 1 times [2021-10-28 22:47:10,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:10,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132505724] [2021-10-28 22:47:10,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:10,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:10,439 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-28 22:47:10,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:10,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132505724] [2021-10-28 22:47:10,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132505724] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:10,440 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:10,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:10,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415807481] [2021-10-28 22:47:10,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:10,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:10,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:10,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:10,443 INFO L87 Difference]: Start difference. First operand 6533 states and 7939 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:10,550 INFO L93 Difference]: Finished difference Result 9801 states and 11845 transitions. [2021-10-28 22:47:10,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:10,551 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-28 22:47:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:10,563 INFO L225 Difference]: With dead ends: 9801 [2021-10-28 22:47:10,563 INFO L226 Difference]: Without dead ends: 6663 [2021-10-28 22:47:10,568 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:10,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6663 states. [2021-10-28 22:47:10,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6663 to 6661. [2021-10-28 22:47:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 7939 transitions. [2021-10-28 22:47:10,792 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 7939 transitions. Word has length 24 [2021-10-28 22:47:10,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:10,792 INFO L470 AbstractCegarLoop]: Abstraction has 6661 states and 7939 transitions. [2021-10-28 22:47:10,792 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-28 22:47:10,793 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 7939 transitions. [2021-10-28 22:47:10,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-28 22:47:10,801 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:10,801 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:10,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-28 22:47:10,801 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:10,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:10,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1656417309, now seen corresponding path program 1 times [2021-10-28 22:47:10,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:10,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842019123] [2021-10-28 22:47:10,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:10,803 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:47:10,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:10,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842019123] [2021-10-28 22:47:10,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842019123] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:10,832 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:10,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:10,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262082992] [2021-10-28 22:47:10,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:10,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:10,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:10,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:10,834 INFO L87 Difference]: Start difference. First operand 6661 states and 7939 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:11,046 INFO L93 Difference]: Finished difference Result 10759 states and 12676 transitions. [2021-10-28 22:47:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:11,047 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-28 22:47:11,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:11,065 INFO L225 Difference]: With dead ends: 10759 [2021-10-28 22:47:11,066 INFO L226 Difference]: Without dead ends: 10757 [2021-10-28 22:47:11,069 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10757 states. [2021-10-28 22:47:11,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10757 to 10245. [2021-10-28 22:47:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 11907 transitions. [2021-10-28 22:47:11,315 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 11907 transitions. Word has length 24 [2021-10-28 22:47:11,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:11,315 INFO L470 AbstractCegarLoop]: Abstraction has 10245 states and 11907 transitions. [2021-10-28 22:47:11,315 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-28 22:47:11,315 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 11907 transitions. [2021-10-28 22:47:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-28 22:47:11,330 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:47:11,330 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:11,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-28 22:47:11,331 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:47:11,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:47:11,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1914582747, now seen corresponding path program 1 times [2021-10-28 22:47:11,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:47:11,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529798683] [2021-10-28 22:47:11,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:47:11,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:47:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:47:11,356 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-28 22:47:11,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:47:11,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529798683] [2021-10-28 22:47:11,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529798683] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:47:11,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:47:11,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:47:11,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939602573] [2021-10-28 22:47:11,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:47:11,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:47:11,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:47:11,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:11,359 INFO L87 Difference]: Start difference. First operand 10245 states and 11907 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:47:11,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:47:11,594 INFO L93 Difference]: Finished difference Result 22789 states and 25987 transitions. [2021-10-28 22:47:11,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:47:11,595 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-28 22:47:11,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:47:11,595 INFO L225 Difference]: With dead ends: 22789 [2021-10-28 22:47:11,595 INFO L226 Difference]: Without dead ends: 0 [2021-10-28 22:47:11,613 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:47:11,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-28 22:47:11,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-28 22:47:11,614 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-28 22:47:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-28 22:47:11,614 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2021-10-28 22:47:11,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:47:11,614 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 22:47:11,614 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-28 22:47:11,615 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-28 22:47:11,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-28 22:47:11,617 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:47:11,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-28 22:47:11,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-28 22:47:11,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:47:11,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:47:11,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:47:11,635 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:47:11,641 INFO L857 garLoopResultBuilder]: For program point L126-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 22:47:11,641 INFO L857 garLoopResultBuilder]: For program point L102(line 102) no Hoare annotation was computed. [2021-10-28 22:47:11,641 INFO L857 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2021-10-28 22:47:11,641 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-28 22:47:11,641 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-28 22:47:11,641 INFO L857 garLoopResultBuilder]: For program point L111-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 22:47:11,642 INFO L857 garLoopResultBuilder]: For program point L136-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 22:47:11,642 INFO L857 garLoopResultBuilder]: For program point L95-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 22:47:11,642 INFO L857 garLoopResultBuilder]: For program point L87-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 22:47:11,645 INFO L857 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2021-10-28 22:47:11,645 INFO L857 garLoopResultBuilder]: For program point L79-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 22:47:11,645 INFO L857 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2021-10-28 22:47:11,645 INFO L857 garLoopResultBuilder]: For program point L71-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 22:47:11,646 INFO L857 garLoopResultBuilder]: For program point L63(lines 63 65) no Hoare annotation was computed. [2021-10-28 22:47:11,646 INFO L857 garLoopResultBuilder]: For program point L63-2(lines 38 146) no Hoare annotation was computed. [2021-10-28 22:47:11,646 INFO L857 garLoopResultBuilder]: For program point L121-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 22:47:11,646 INFO L857 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2021-10-28 22:47:11,646 INFO L860 garLoopResultBuilder]: At program point L147(lines 7 151) the Hoare annotation is: true [2021-10-28 22:47:11,647 INFO L857 garLoopResultBuilder]: For program point L106-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 22:47:11,647 INFO L857 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2021-10-28 22:47:11,647 INFO L857 garLoopResultBuilder]: For program point L131-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 22:47:11,647 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-28 22:47:11,647 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2021-10-28 22:47:11,647 INFO L857 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2021-10-28 22:47:11,648 INFO L857 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2021-10-28 22:47:11,648 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-28 22:47:11,648 INFO L857 garLoopResultBuilder]: For program point L91-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 22:47:11,648 INFO L857 garLoopResultBuilder]: For program point L116-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 22:47:11,648 INFO L857 garLoopResultBuilder]: For program point L83-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 22:47:11,648 INFO L860 garLoopResultBuilder]: At program point L141-1(lines 38 146) the Hoare annotation is: true [2021-10-28 22:47:11,648 INFO L857 garLoopResultBuilder]: For program point L75-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 22:47:11,649 INFO L857 garLoopResultBuilder]: For program point L67-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 22:47:11,650 INFO L860 garLoopResultBuilder]: At program point L150(lines 6 151) the Hoare annotation is: true [2021-10-28 22:47:11,650 INFO L857 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2021-10-28 22:47:11,650 INFO L857 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2021-10-28 22:47:11,651 INFO L853 garLoopResultBuilder]: At program point L142-1(lines 7 151) the Hoare annotation is: false [2021-10-28 22:47:11,651 INFO L857 garLoopResultBuilder]: For program point L101-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 22:47:11,654 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:47:11,655 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 22:47:11,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 10:47:11 BoogieIcfgContainer [2021-10-28 22:47:11,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 22:47:11,665 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 22:47:11,665 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 22:47:11,665 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 22:47:11,666 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:47:05" (3/4) ... [2021-10-28 22:47:11,668 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 22:47:11,681 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-28 22:47:11,682 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-28 22:47:11,682 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 22:47:11,683 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 22:47:11,741 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 22:47:11,741 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 22:47:11,743 INFO L168 Benchmark]: Toolchain (without parser) took 7086.72 ms. Allocated memory was 119.5 MB in the beginning and 285.2 MB in the end (delta: 165.7 MB). Free memory was 83.5 MB in the beginning and 143.4 MB in the end (delta: -59.9 MB). Peak memory consumption was 104.8 MB. Max. memory is 16.1 GB. [2021-10-28 22:47:11,743 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 119.5 MB. Free memory is still 100.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 22:47:11,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.50 ms. Allocated memory is still 119.5 MB. Free memory was 83.3 MB in the beginning and 95.5 MB in the end (delta: -12.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 22:47:11,744 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.55 ms. Allocated memory is still 119.5 MB. Free memory was 95.5 MB in the beginning and 93.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 22:47:11,745 INFO L168 Benchmark]: Boogie Preprocessor took 31.74 ms. Allocated memory is still 119.5 MB. Free memory was 93.9 MB in the beginning and 92.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 22:47:11,745 INFO L168 Benchmark]: RCFGBuilder took 404.92 ms. Allocated memory is still 119.5 MB. Free memory was 92.4 MB in the beginning and 80.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-28 22:47:11,746 INFO L168 Benchmark]: TraceAbstraction took 6193.52 ms. Allocated memory was 119.5 MB in the beginning and 285.2 MB in the end (delta: 165.7 MB). Free memory was 79.8 MB in the beginning and 147.6 MB in the end (delta: -67.8 MB). Peak memory consumption was 98.9 MB. Max. memory is 16.1 GB. [2021-10-28 22:47:11,746 INFO L168 Benchmark]: Witness Printer took 76.29 ms. Allocated memory is still 285.2 MB. Free memory was 147.6 MB in the beginning and 144.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-28 22:47:11,748 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.22 ms. Allocated memory is still 119.5 MB. Free memory is still 100.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 328.50 ms. Allocated memory is still 119.5 MB. Free memory was 83.3 MB in the beginning and 95.5 MB in the end (delta: -12.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.55 ms. Allocated memory is still 119.5 MB. Free memory was 95.5 MB in the beginning and 93.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.74 ms. Allocated memory is still 119.5 MB. Free memory was 93.9 MB in the beginning and 92.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 404.92 ms. Allocated memory is still 119.5 MB. Free memory was 92.4 MB in the beginning and 80.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6193.52 ms. Allocated memory was 119.5 MB in the beginning and 285.2 MB in the end (delta: 165.7 MB). Free memory was 79.8 MB in the beginning and 147.6 MB in the end (delta: -67.8 MB). Peak memory consumption was 98.9 MB. Max. memory is 16.1 GB. * Witness Printer took 76.29 ms. Allocated memory is still 285.2 MB. Free memory was 147.6 MB in the beginning and 144.5 MB in the end (delta: 3.1 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 149]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1866 SDtfs, 922 SDslu, 1232 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10245occurred in iteration=24, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 521 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 480 ConstructedInterpolants, 0 QuantifiedInterpolants, 1011 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2021-10-28 22:47:11,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_85b04dd5-9b8d-4718-9ab9-e0103d3af8f6/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...