./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8e3b3fb-d0e5-49fb-bb2f-b43940dd5147/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8e3b3fb-d0e5-49fb-bb2f-b43940dd5147/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8e3b3fb-d0e5-49fb-bb2f-b43940dd5147/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8e3b3fb-d0e5-49fb-bb2f-b43940dd5147/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_12.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8e3b3fb-d0e5-49fb-bb2f-b43940dd5147/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8e3b3fb-d0e5-49fb-bb2f-b43940dd5147/bin/uautomizer-Z5i5R5N3CC --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 fbb7e06bf350f46f725ea0ddc5d1215829061b3a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 00:30:44,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:30:44,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:30:44,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:30:44,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:30:44,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:30:44,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:30:44,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:30:44,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:30:44,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:30:44,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:30:44,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:30:44,924 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:30:44,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:30:44,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:30:44,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:30:44,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:30:44,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:30:44,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:30:44,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:30:44,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:30:44,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:30:44,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:30:44,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:30:44,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:30:44,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:30:44,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:30:44,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:30:44,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:30:44,971 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:30:44,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:30:44,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:30:44,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:30:44,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:30:44,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:30:44,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:30:44,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:30:44,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:30:44,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:30:44,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:30:44,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:30:44,984 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8e3b3fb-d0e5-49fb-bb2f-b43940dd5147/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-11 00:30:45,022 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:30:45,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:30:45,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:30:45,025 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:30:45,025 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:30:45,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:30:45,026 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:30:45,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:30:45,027 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:30:45,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:30:45,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 00:30:45,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 00:30:45,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 00:30:45,036 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:30:45,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:30:45,036 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:30:45,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 00:30:45,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:30:45,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:30:45,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 00:30:45,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:30:45,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:30:45,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 00:30:45,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 00:30:45,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:30:45,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 00:30:45,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 00:30:45,040 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:30:45,040 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_c8e3b3fb-d0e5-49fb-bb2f-b43940dd5147/bin/uautomizer-Z5i5R5N3CC/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_c8e3b3fb-d0e5-49fb-bb2f-b43940dd5147/bin/uautomizer-Z5i5R5N3CC 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 -> fbb7e06bf350f46f725ea0ddc5d1215829061b3a [2021-10-11 00:30:45,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:30:45,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:30:45,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:30:45,376 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:30:45,378 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:30:45,380 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8e3b3fb-d0e5-49fb-bb2f-b43940dd5147/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/locks/test_locks_12.c [2021-10-11 00:30:45,450 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8e3b3fb-d0e5-49fb-bb2f-b43940dd5147/bin/uautomizer-Z5i5R5N3CC/data/ebcb328aa/0748af1d25124edfb1c81db05c20e79b/FLAG64c867d4e [2021-10-11 00:30:45,994 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:30:45,994 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8e3b3fb-d0e5-49fb-bb2f-b43940dd5147/sv-benchmarks/c/locks/test_locks_12.c [2021-10-11 00:30:46,004 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8e3b3fb-d0e5-49fb-bb2f-b43940dd5147/bin/uautomizer-Z5i5R5N3CC/data/ebcb328aa/0748af1d25124edfb1c81db05c20e79b/FLAG64c867d4e [2021-10-11 00:30:46,364 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8e3b3fb-d0e5-49fb-bb2f-b43940dd5147/bin/uautomizer-Z5i5R5N3CC/data/ebcb328aa/0748af1d25124edfb1c81db05c20e79b [2021-10-11 00:30:46,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:30:46,368 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:30:46,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:30:46,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:30:46,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:30:46,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:30:46" (1/1) ... [2021-10-11 00:30:46,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b8de0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:46, skipping insertion in model container [2021-10-11 00:30:46,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:30:46" (1/1) ... [2021-10-11 00:30:46,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:30:46,429 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:30:46,603 WARN L226 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_c8e3b3fb-d0e5-49fb-bb2f-b43940dd5147/sv-benchmarks/c/locks/test_locks_12.c[4591,4604] [2021-10-11 00:30:46,615 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:30:46,623 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:30:46,650 WARN L226 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_c8e3b3fb-d0e5-49fb-bb2f-b43940dd5147/sv-benchmarks/c/locks/test_locks_12.c[4591,4604] [2021-10-11 00:30:46,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:30:46,666 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:30:46,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:46 WrapperNode [2021-10-11 00:30:46,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:30:46,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:30:46,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:30:46,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:30:46,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:46" (1/1) ... [2021-10-11 00:30:46,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:46" (1/1) ... [2021-10-11 00:30:46,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:30:46,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:30:46,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:30:46,709 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:30:46,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:46" (1/1) ... [2021-10-11 00:30:46,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:46" (1/1) ... [2021-10-11 00:30:46,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:46" (1/1) ... [2021-10-11 00:30:46,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:46" (1/1) ... [2021-10-11 00:30:46,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:46" (1/1) ... [2021-10-11 00:30:46,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:46" (1/1) ... [2021-10-11 00:30:46,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:46" (1/1) ... [2021-10-11 00:30:46,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:30:46,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:30:46,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:30:46,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:30:46,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:46" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8e3b3fb-d0e5-49fb-bb2f-b43940dd5147/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:30:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:30:46,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:30:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 00:30:46,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:30:47,230 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:30:47,231 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-11 00:30:47,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:30:47 BoogieIcfgContainer [2021-10-11 00:30:47,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:30:47,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 00:30:47,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 00:30:47,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 00:30:47,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:30:46" (1/3) ... [2021-10-11 00:30:47,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2346f00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:30:47, skipping insertion in model container [2021-10-11 00:30:47,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:30:46" (2/3) ... [2021-10-11 00:30:47,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2346f00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:30:47, skipping insertion in model container [2021-10-11 00:30:47,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:30:47" (3/3) ... [2021-10-11 00:30:47,242 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2021-10-11 00:30:47,256 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 00:30:47,260 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-10-11 00:30:47,271 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-11 00:30:47,300 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 00:30:47,301 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 00:30:47,301 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 00:30:47,301 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:30:47,301 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:30:47,301 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 00:30:47,301 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:30:47,302 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 00:30:47,317 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2021-10-11 00:30:47,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 00:30:47,322 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:47,323 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:47,324 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:47,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:47,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1341605783, now seen corresponding path program 1 times [2021-10-11 00:30:47,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:47,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185940839] [2021-10-11 00:30:47,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:47,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-11 00:30:47,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185940839] [2021-10-11 00:30:47,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:47,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:47,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767527771] [2021-10-11 00:30:47,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:47,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:47,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:47,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:47,642 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2021-10-11 00:30:47,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:47,685 INFO L93 Difference]: Finished difference Result 95 states and 169 transitions. [2021-10-11 00:30:47,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:47,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2021-10-11 00:30:47,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:47,698 INFO L225 Difference]: With dead ends: 95 [2021-10-11 00:30:47,698 INFO L226 Difference]: Without dead ends: 81 [2021-10-11 00:30:47,701 INFO L677 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-11 00:30:47,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-10-11 00:30:47,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2021-10-11 00:30:47,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2021-10-11 00:30:47,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 102 transitions. [2021-10-11 00:30:47,761 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 102 transitions. Word has length 19 [2021-10-11 00:30:47,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:47,762 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 102 transitions. [2021-10-11 00:30:47,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:47,763 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 102 transitions. [2021-10-11 00:30:47,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 00:30:47,766 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:47,766 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:47,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 00:30:47,766 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:47,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:47,771 INFO L82 PathProgramCache]: Analyzing trace with hash 61742105, now seen corresponding path program 1 times [2021-10-11 00:30:47,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:47,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092289328] [2021-10-11 00:30:47,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:47,864 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-11 00:30:47,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092289328] [2021-10-11 00:30:47,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:47,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:47,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108425476] [2021-10-11 00:30:47,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:47,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:47,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:47,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:47,868 INFO L87 Difference]: Start difference. First operand 55 states and 102 transitions. Second operand 3 states. [2021-10-11 00:30:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:47,911 INFO L93 Difference]: Finished difference Result 134 states and 249 transitions. [2021-10-11 00:30:47,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:47,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2021-10-11 00:30:47,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:47,913 INFO L225 Difference]: With dead ends: 134 [2021-10-11 00:30:47,914 INFO L226 Difference]: Without dead ends: 81 [2021-10-11 00:30:47,915 INFO L677 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-11 00:30:47,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-10-11 00:30:47,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2021-10-11 00:30:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2021-10-11 00:30:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 146 transitions. [2021-10-11 00:30:47,932 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 146 transitions. Word has length 19 [2021-10-11 00:30:47,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:47,932 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 146 transitions. [2021-10-11 00:30:47,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 146 transitions. [2021-10-11 00:30:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-11 00:30:47,936 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:47,937 INFO L422 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-11 00:30:47,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 00:30:47,938 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:47,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:47,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1359680987, now seen corresponding path program 1 times [2021-10-11 00:30:47,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:47,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632551375] [2021-10-11 00:30:47,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:48,030 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-11 00:30:48,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632551375] [2021-10-11 00:30:48,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:48,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:48,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563204052] [2021-10-11 00:30:48,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:48,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:48,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:48,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:48,041 INFO L87 Difference]: Start difference. First operand 79 states and 146 transitions. Second operand 3 states. [2021-10-11 00:30:48,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:48,078 INFO L93 Difference]: Finished difference Result 123 states and 222 transitions. [2021-10-11 00:30:48,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:48,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2021-10-11 00:30:48,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:48,080 INFO L225 Difference]: With dead ends: 123 [2021-10-11 00:30:48,080 INFO L226 Difference]: Without dead ends: 84 [2021-10-11 00:30:48,081 INFO L677 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-11 00:30:48,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-10-11 00:30:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2021-10-11 00:30:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2021-10-11 00:30:48,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 148 transitions. [2021-10-11 00:30:48,090 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 148 transitions. Word has length 20 [2021-10-11 00:30:48,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:48,091 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 148 transitions. [2021-10-11 00:30:48,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:48,091 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 148 transitions. [2021-10-11 00:30:48,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-11 00:30:48,092 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:48,092 INFO L422 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-11 00:30:48,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 00:30:48,093 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:48,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:48,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1914217955, now seen corresponding path program 1 times [2021-10-11 00:30:48,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:48,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11273123] [2021-10-11 00:30:48,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:48,147 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-11 00:30:48,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11273123] [2021-10-11 00:30:48,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:48,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:48,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379593244] [2021-10-11 00:30:48,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:48,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:48,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:48,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:48,150 INFO L87 Difference]: Start difference. First operand 82 states and 148 transitions. Second operand 3 states. [2021-10-11 00:30:48,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:48,167 INFO L93 Difference]: Finished difference Result 157 states and 285 transitions. [2021-10-11 00:30:48,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:48,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2021-10-11 00:30:48,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:48,170 INFO L225 Difference]: With dead ends: 157 [2021-10-11 00:30:48,170 INFO L226 Difference]: Without dead ends: 155 [2021-10-11 00:30:48,171 INFO L677 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-11 00:30:48,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-10-11 00:30:48,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2021-10-11 00:30:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2021-10-11 00:30:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 197 transitions. [2021-10-11 00:30:48,182 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 197 transitions. Word has length 20 [2021-10-11 00:30:48,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:48,183 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 197 transitions. [2021-10-11 00:30:48,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 197 transitions. [2021-10-11 00:30:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-11 00:30:48,184 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:48,185 INFO L422 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-11 00:30:48,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 00:30:48,185 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:48,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:48,186 INFO L82 PathProgramCache]: Analyzing trace with hash 634354277, now seen corresponding path program 1 times [2021-10-11 00:30:48,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:48,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684550486] [2021-10-11 00:30:48,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:48,223 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-11 00:30:48,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684550486] [2021-10-11 00:30:48,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:48,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:48,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792071869] [2021-10-11 00:30:48,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:48,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:48,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:48,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:48,226 INFO L87 Difference]: Start difference. First operand 109 states and 197 transitions. Second operand 3 states. [2021-10-11 00:30:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:48,244 INFO L93 Difference]: Finished difference Result 261 states and 475 transitions. [2021-10-11 00:30:48,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:48,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2021-10-11 00:30:48,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:48,246 INFO L225 Difference]: With dead ends: 261 [2021-10-11 00:30:48,247 INFO L226 Difference]: Without dead ends: 157 [2021-10-11 00:30:48,248 INFO L677 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-11 00:30:48,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-10-11 00:30:48,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2021-10-11 00:30:48,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2021-10-11 00:30:48,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 279 transitions. [2021-10-11 00:30:48,259 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 279 transitions. Word has length 20 [2021-10-11 00:30:48,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:48,260 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 279 transitions. [2021-10-11 00:30:48,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 279 transitions. [2021-10-11 00:30:48,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-11 00:30:48,262 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:48,262 INFO L422 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-11 00:30:48,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 00:30:48,262 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:48,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:48,263 INFO L82 PathProgramCache]: Analyzing trace with hash -788572498, now seen corresponding path program 1 times [2021-10-11 00:30:48,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:48,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608442309] [2021-10-11 00:30:48,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:48,300 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-11 00:30:48,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608442309] [2021-10-11 00:30:48,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:48,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:48,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192272568] [2021-10-11 00:30:48,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:48,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:48,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:48,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:48,303 INFO L87 Difference]: Start difference. First operand 155 states and 279 transitions. Second operand 3 states. [2021-10-11 00:30:48,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:48,321 INFO L93 Difference]: Finished difference Result 234 states and 418 transitions. [2021-10-11 00:30:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:48,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2021-10-11 00:30:48,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:48,323 INFO L225 Difference]: With dead ends: 234 [2021-10-11 00:30:48,324 INFO L226 Difference]: Without dead ends: 159 [2021-10-11 00:30:48,325 INFO L677 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-11 00:30:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-10-11 00:30:48,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2021-10-11 00:30:48,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2021-10-11 00:30:48,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2021-10-11 00:30:48,347 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 21 [2021-10-11 00:30:48,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:48,348 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2021-10-11 00:30:48,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:48,348 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2021-10-11 00:30:48,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-11 00:30:48,350 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:48,350 INFO L422 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-11 00:30:48,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 00:30:48,350 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:48,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:48,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1809640852, now seen corresponding path program 1 times [2021-10-11 00:30:48,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:48,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984154085] [2021-10-11 00:30:48,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:48,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:30:48,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984154085] [2021-10-11 00:30:48,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:48,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:48,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049471410] [2021-10-11 00:30:48,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:48,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:48,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:48,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:48,422 INFO L87 Difference]: Start difference. First operand 157 states and 279 transitions. Second operand 3 states. [2021-10-11 00:30:48,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:48,455 INFO L93 Difference]: Finished difference Result 453 states and 809 transitions. [2021-10-11 00:30:48,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:48,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2021-10-11 00:30:48,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:48,458 INFO L225 Difference]: With dead ends: 453 [2021-10-11 00:30:48,458 INFO L226 Difference]: Without dead ends: 303 [2021-10-11 00:30:48,459 INFO L677 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-11 00:30:48,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-10-11 00:30:48,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2021-10-11 00:30:48,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2021-10-11 00:30:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 531 transitions. [2021-10-11 00:30:48,476 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 531 transitions. Word has length 21 [2021-10-11 00:30:48,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:48,476 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 531 transitions. [2021-10-11 00:30:48,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:48,477 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 531 transitions. [2021-10-11 00:30:48,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-11 00:30:48,479 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:48,479 INFO L422 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-11 00:30:48,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 00:30:48,479 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:48,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:48,480 INFO L82 PathProgramCache]: Analyzing trace with hash -529777174, now seen corresponding path program 1 times [2021-10-11 00:30:48,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:48,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23154369] [2021-10-11 00:30:48,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:48,510 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-11 00:30:48,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23154369] [2021-10-11 00:30:48,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:48,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:48,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448559899] [2021-10-11 00:30:48,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:48,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:48,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:48,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:48,513 INFO L87 Difference]: Start difference. First operand 301 states and 531 transitions. Second operand 3 states. [2021-10-11 00:30:48,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:48,528 INFO L93 Difference]: Finished difference Result 385 states and 685 transitions. [2021-10-11 00:30:48,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:48,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2021-10-11 00:30:48,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:48,532 INFO L225 Difference]: With dead ends: 385 [2021-10-11 00:30:48,532 INFO L226 Difference]: Without dead ends: 383 [2021-10-11 00:30:48,533 INFO L677 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-11 00:30:48,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-10-11 00:30:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 301. [2021-10-11 00:30:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2021-10-11 00:30:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 527 transitions. [2021-10-11 00:30:48,546 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 527 transitions. Word has length 21 [2021-10-11 00:30:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:48,547 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 527 transitions. [2021-10-11 00:30:48,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 527 transitions. [2021-10-11 00:30:48,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 00:30:48,549 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:48,549 INFO L422 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-11 00:30:48,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 00:30:48,550 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:48,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:48,550 INFO L82 PathProgramCache]: Analyzing trace with hash -264078182, now seen corresponding path program 1 times [2021-10-11 00:30:48,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:48,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105515232] [2021-10-11 00:30:48,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:30:48,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105515232] [2021-10-11 00:30:48,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:48,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:48,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128694623] [2021-10-11 00:30:48,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:48,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:48,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:48,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:48,610 INFO L87 Difference]: Start difference. First operand 301 states and 527 transitions. Second operand 3 states. [2021-10-11 00:30:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:48,644 INFO L93 Difference]: Finished difference Result 565 states and 1001 transitions. [2021-10-11 00:30:48,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:48,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2021-10-11 00:30:48,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:48,648 INFO L225 Difference]: With dead ends: 565 [2021-10-11 00:30:48,649 INFO L226 Difference]: Without dead ends: 563 [2021-10-11 00:30:48,649 INFO L677 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-11 00:30:48,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-10-11 00:30:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 417. [2021-10-11 00:30:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2021-10-11 00:30:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 719 transitions. [2021-10-11 00:30:48,681 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 719 transitions. Word has length 22 [2021-10-11 00:30:48,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:48,682 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 719 transitions. [2021-10-11 00:30:48,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:48,682 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 719 transitions. [2021-10-11 00:30:48,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 00:30:48,686 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:48,686 INFO L422 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-11 00:30:48,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 00:30:48,687 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:48,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:48,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1543941860, now seen corresponding path program 1 times [2021-10-11 00:30:48,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:48,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632719562] [2021-10-11 00:30:48,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:48,741 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-11 00:30:48,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632719562] [2021-10-11 00:30:48,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:48,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:48,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769587769] [2021-10-11 00:30:48,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:48,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:48,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:48,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:48,745 INFO L87 Difference]: Start difference. First operand 417 states and 719 transitions. Second operand 3 states. [2021-10-11 00:30:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:48,784 INFO L93 Difference]: Finished difference Result 997 states and 1729 transitions. [2021-10-11 00:30:48,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:48,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2021-10-11 00:30:48,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:48,790 INFO L225 Difference]: With dead ends: 997 [2021-10-11 00:30:48,791 INFO L226 Difference]: Without dead ends: 587 [2021-10-11 00:30:48,793 INFO L677 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-11 00:30:48,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2021-10-11 00:30:48,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2021-10-11 00:30:48,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2021-10-11 00:30:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1003 transitions. [2021-10-11 00:30:48,829 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1003 transitions. Word has length 22 [2021-10-11 00:30:48,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:48,831 INFO L481 AbstractCegarLoop]: Abstraction has 585 states and 1003 transitions. [2021-10-11 00:30:48,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:48,831 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1003 transitions. [2021-10-11 00:30:48,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-11 00:30:48,834 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:48,834 INFO L422 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-11 00:30:48,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-11 00:30:48,834 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:48,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:48,836 INFO L82 PathProgramCache]: Analyzing trace with hash 403724673, now seen corresponding path program 1 times [2021-10-11 00:30:48,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:48,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406744344] [2021-10-11 00:30:48,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:48,884 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-11 00:30:48,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406744344] [2021-10-11 00:30:48,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:48,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:48,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746877726] [2021-10-11 00:30:48,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:48,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:48,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:48,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:48,888 INFO L87 Difference]: Start difference. First operand 585 states and 1003 transitions. Second operand 3 states. [2021-10-11 00:30:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:48,915 INFO L93 Difference]: Finished difference Result 885 states and 1513 transitions. [2021-10-11 00:30:48,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:48,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2021-10-11 00:30:48,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:48,920 INFO L225 Difference]: With dead ends: 885 [2021-10-11 00:30:48,920 INFO L226 Difference]: Without dead ends: 599 [2021-10-11 00:30:48,922 INFO L677 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-11 00:30:48,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-10-11 00:30:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2021-10-11 00:30:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2021-10-11 00:30:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1011 transitions. [2021-10-11 00:30:48,940 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1011 transitions. Word has length 23 [2021-10-11 00:30:48,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:48,941 INFO L481 AbstractCegarLoop]: Abstraction has 597 states and 1011 transitions. [2021-10-11 00:30:48,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:48,941 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1011 transitions. [2021-10-11 00:30:48,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-11 00:30:48,942 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:48,943 INFO L422 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-11 00:30:48,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 00:30:48,943 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:48,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:48,944 INFO L82 PathProgramCache]: Analyzing trace with hash -617343681, now seen corresponding path program 1 times [2021-10-11 00:30:48,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:48,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852297880] [2021-10-11 00:30:48,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:49,008 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-11 00:30:49,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852297880] [2021-10-11 00:30:49,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:49,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:49,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403040566] [2021-10-11 00:30:49,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:49,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:49,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:49,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:49,010 INFO L87 Difference]: Start difference. First operand 597 states and 1011 transitions. Second operand 3 states. [2021-10-11 00:30:49,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:49,037 INFO L93 Difference]: Finished difference Result 1097 states and 1885 transitions. [2021-10-11 00:30:49,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:49,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2021-10-11 00:30:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:49,046 INFO L225 Difference]: With dead ends: 1097 [2021-10-11 00:30:49,046 INFO L226 Difference]: Without dead ends: 1095 [2021-10-11 00:30:49,047 INFO L677 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-11 00:30:49,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2021-10-11 00:30:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 837. [2021-10-11 00:30:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2021-10-11 00:30:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1387 transitions. [2021-10-11 00:30:49,076 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1387 transitions. Word has length 23 [2021-10-11 00:30:49,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:49,077 INFO L481 AbstractCegarLoop]: Abstraction has 837 states and 1387 transitions. [2021-10-11 00:30:49,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:49,077 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1387 transitions. [2021-10-11 00:30:49,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-11 00:30:49,079 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:49,080 INFO L422 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-11 00:30:49,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-11 00:30:49,080 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:49,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:49,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1897207359, now seen corresponding path program 1 times [2021-10-11 00:30:49,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:49,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369970375] [2021-10-11 00:30:49,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:49,133 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-11 00:30:49,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369970375] [2021-10-11 00:30:49,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:49,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:49,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989673039] [2021-10-11 00:30:49,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:49,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:49,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:49,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:49,138 INFO L87 Difference]: Start difference. First operand 837 states and 1387 transitions. Second operand 3 states. [2021-10-11 00:30:49,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:49,179 INFO L93 Difference]: Finished difference Result 1977 states and 3293 transitions. [2021-10-11 00:30:49,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:49,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2021-10-11 00:30:49,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:49,190 INFO L225 Difference]: With dead ends: 1977 [2021-10-11 00:30:49,191 INFO L226 Difference]: Without dead ends: 1159 [2021-10-11 00:30:49,196 INFO L677 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-11 00:30:49,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2021-10-11 00:30:49,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1157. [2021-10-11 00:30:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2021-10-11 00:30:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1907 transitions. [2021-10-11 00:30:49,234 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1907 transitions. Word has length 23 [2021-10-11 00:30:49,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:49,237 INFO L481 AbstractCegarLoop]: Abstraction has 1157 states and 1907 transitions. [2021-10-11 00:30:49,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:49,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1907 transitions. [2021-10-11 00:30:49,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-11 00:30:49,239 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:49,240 INFO L422 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-11 00:30:49,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-11 00:30:49,240 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:49,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:49,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1957570863, now seen corresponding path program 1 times [2021-10-11 00:30:49,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:49,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953232810] [2021-10-11 00:30:49,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:49,274 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-11 00:30:49,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953232810] [2021-10-11 00:30:49,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:49,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:49,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001146927] [2021-10-11 00:30:49,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:49,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:49,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:49,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:49,278 INFO L87 Difference]: Start difference. First operand 1157 states and 1907 transitions. Second operand 3 states. [2021-10-11 00:30:49,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:49,318 INFO L93 Difference]: Finished difference Result 1737 states and 2853 transitions. [2021-10-11 00:30:49,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:49,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2021-10-11 00:30:49,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:49,326 INFO L225 Difference]: With dead ends: 1737 [2021-10-11 00:30:49,326 INFO L226 Difference]: Without dead ends: 1175 [2021-10-11 00:30:49,329 INFO L677 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-11 00:30:49,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2021-10-11 00:30:49,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1173. [2021-10-11 00:30:49,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2021-10-11 00:30:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1907 transitions. [2021-10-11 00:30:49,374 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1907 transitions. Word has length 24 [2021-10-11 00:30:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:49,375 INFO L481 AbstractCegarLoop]: Abstraction has 1173 states and 1907 transitions. [2021-10-11 00:30:49,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:49,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1907 transitions. [2021-10-11 00:30:49,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-11 00:30:49,378 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:49,378 INFO L422 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-11 00:30:49,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-11 00:30:49,378 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:49,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:49,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1316328079, now seen corresponding path program 1 times [2021-10-11 00:30:49,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:49,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061689960] [2021-10-11 00:30:49,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:49,410 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-11 00:30:49,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061689960] [2021-10-11 00:30:49,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:49,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:49,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094370298] [2021-10-11 00:30:49,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:49,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:49,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:49,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:49,418 INFO L87 Difference]: Start difference. First operand 1173 states and 1907 transitions. Second operand 3 states. [2021-10-11 00:30:49,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:49,460 INFO L93 Difference]: Finished difference Result 2121 states and 3509 transitions. [2021-10-11 00:30:49,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:49,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2021-10-11 00:30:49,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:49,473 INFO L225 Difference]: With dead ends: 2121 [2021-10-11 00:30:49,474 INFO L226 Difference]: Without dead ends: 2119 [2021-10-11 00:30:49,476 INFO L677 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-11 00:30:49,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2021-10-11 00:30:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1669. [2021-10-11 00:30:49,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2021-10-11 00:30:49,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2643 transitions. [2021-10-11 00:30:49,539 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2643 transitions. Word has length 24 [2021-10-11 00:30:49,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:49,540 INFO L481 AbstractCegarLoop]: Abstraction has 1669 states and 2643 transitions. [2021-10-11 00:30:49,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:49,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2643 transitions. [2021-10-11 00:30:49,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-11 00:30:49,543 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:49,543 INFO L422 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-11 00:30:49,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-11 00:30:49,544 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:49,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:49,544 INFO L82 PathProgramCache]: Analyzing trace with hash 36464401, now seen corresponding path program 1 times [2021-10-11 00:30:49,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:49,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346625007] [2021-10-11 00:30:49,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:49,570 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-11 00:30:49,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346625007] [2021-10-11 00:30:49,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:49,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:49,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101319245] [2021-10-11 00:30:49,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:49,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:49,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:49,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:49,575 INFO L87 Difference]: Start difference. First operand 1669 states and 2643 transitions. Second operand 3 states. [2021-10-11 00:30:49,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:49,624 INFO L93 Difference]: Finished difference Result 3913 states and 6229 transitions. [2021-10-11 00:30:49,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:49,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2021-10-11 00:30:49,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:49,639 INFO L225 Difference]: With dead ends: 3913 [2021-10-11 00:30:49,639 INFO L226 Difference]: Without dead ends: 2279 [2021-10-11 00:30:49,644 INFO L677 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-11 00:30:49,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2021-10-11 00:30:49,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2277. [2021-10-11 00:30:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2277 states. [2021-10-11 00:30:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 3587 transitions. [2021-10-11 00:30:49,719 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 3587 transitions. Word has length 24 [2021-10-11 00:30:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:49,720 INFO L481 AbstractCegarLoop]: Abstraction has 2277 states and 3587 transitions. [2021-10-11 00:30:49,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 3587 transitions. [2021-10-11 00:30:49,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-11 00:30:49,738 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:49,739 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:49,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-11 00:30:49,739 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:49,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:49,739 INFO L82 PathProgramCache]: Analyzing trace with hash -2143288106, now seen corresponding path program 1 times [2021-10-11 00:30:49,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:49,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445660283] [2021-10-11 00:30:49,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:49,774 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-11 00:30:49,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445660283] [2021-10-11 00:30:49,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:49,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:49,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906397079] [2021-10-11 00:30:49,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:49,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:49,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:49,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:49,776 INFO L87 Difference]: Start difference. First operand 2277 states and 3587 transitions. Second operand 3 states. [2021-10-11 00:30:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:49,825 INFO L93 Difference]: Finished difference Result 3417 states and 5365 transitions. [2021-10-11 00:30:49,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:49,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2021-10-11 00:30:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:49,838 INFO L225 Difference]: With dead ends: 3417 [2021-10-11 00:30:49,838 INFO L226 Difference]: Without dead ends: 2311 [2021-10-11 00:30:49,841 INFO L677 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-11 00:30:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2021-10-11 00:30:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2309. [2021-10-11 00:30:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2309 states. [2021-10-11 00:30:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3587 transitions. [2021-10-11 00:30:49,909 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3587 transitions. Word has length 25 [2021-10-11 00:30:49,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:49,909 INFO L481 AbstractCegarLoop]: Abstraction has 2309 states and 3587 transitions. [2021-10-11 00:30:49,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3587 transitions. [2021-10-11 00:30:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-11 00:30:49,912 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:49,913 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:49,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-11 00:30:49,913 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:49,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:49,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1130610836, now seen corresponding path program 1 times [2021-10-11 00:30:49,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:49,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481203578] [2021-10-11 00:30:49,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:49,941 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-11 00:30:49,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481203578] [2021-10-11 00:30:49,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:49,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:49,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210067823] [2021-10-11 00:30:49,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:49,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:49,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:49,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:49,947 INFO L87 Difference]: Start difference. First operand 2309 states and 3587 transitions. Second operand 3 states. [2021-10-11 00:30:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:50,009 INFO L93 Difference]: Finished difference Result 4105 states and 6501 transitions. [2021-10-11 00:30:50,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:50,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2021-10-11 00:30:50,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:50,032 INFO L225 Difference]: With dead ends: 4105 [2021-10-11 00:30:50,032 INFO L226 Difference]: Without dead ends: 4103 [2021-10-11 00:30:50,035 INFO L677 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-11 00:30:50,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2021-10-11 00:30:50,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 3333. [2021-10-11 00:30:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3333 states. [2021-10-11 00:30:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 5027 transitions. [2021-10-11 00:30:50,162 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 5027 transitions. Word has length 25 [2021-10-11 00:30:50,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:50,162 INFO L481 AbstractCegarLoop]: Abstraction has 3333 states and 5027 transitions. [2021-10-11 00:30:50,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:50,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 5027 transitions. [2021-10-11 00:30:50,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-11 00:30:50,166 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:50,167 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:50,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-11 00:30:50,167 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:50,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:50,167 INFO L82 PathProgramCache]: Analyzing trace with hash -149252842, now seen corresponding path program 1 times [2021-10-11 00:30:50,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:50,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77151711] [2021-10-11 00:30:50,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:50,192 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-11 00:30:50,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77151711] [2021-10-11 00:30:50,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:50,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:50,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339576128] [2021-10-11 00:30:50,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:50,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:50,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:50,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:50,195 INFO L87 Difference]: Start difference. First operand 3333 states and 5027 transitions. Second operand 3 states. [2021-10-11 00:30:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:50,268 INFO L93 Difference]: Finished difference Result 7753 states and 11749 transitions. [2021-10-11 00:30:50,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:50,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2021-10-11 00:30:50,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:50,292 INFO L225 Difference]: With dead ends: 7753 [2021-10-11 00:30:50,292 INFO L226 Difference]: Without dead ends: 4487 [2021-10-11 00:30:50,296 INFO L677 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-11 00:30:50,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2021-10-11 00:30:50,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 4485. [2021-10-11 00:30:50,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4485 states. [2021-10-11 00:30:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 6723 transitions. [2021-10-11 00:30:50,426 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 6723 transitions. Word has length 25 [2021-10-11 00:30:50,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:50,426 INFO L481 AbstractCegarLoop]: Abstraction has 4485 states and 6723 transitions. [2021-10-11 00:30:50,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:50,426 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 6723 transitions. [2021-10-11 00:30:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-11 00:30:50,433 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:50,433 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:50,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-11 00:30:50,434 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:50,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:50,434 INFO L82 PathProgramCache]: Analyzing trace with hash 689412294, now seen corresponding path program 1 times [2021-10-11 00:30:50,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:50,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658294824] [2021-10-11 00:30:50,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:50,492 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-11 00:30:50,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658294824] [2021-10-11 00:30:50,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:50,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:50,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892323905] [2021-10-11 00:30:50,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:50,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:50,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:50,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:50,493 INFO L87 Difference]: Start difference. First operand 4485 states and 6723 transitions. Second operand 3 states. [2021-10-11 00:30:50,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:50,550 INFO L93 Difference]: Finished difference Result 6729 states and 10053 transitions. [2021-10-11 00:30:50,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:50,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2021-10-11 00:30:50,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:50,580 INFO L225 Difference]: With dead ends: 6729 [2021-10-11 00:30:50,580 INFO L226 Difference]: Without dead ends: 4551 [2021-10-11 00:30:50,583 INFO L677 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-11 00:30:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4551 states. [2021-10-11 00:30:50,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4551 to 4549. [2021-10-11 00:30:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4549 states. [2021-10-11 00:30:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 6723 transitions. [2021-10-11 00:30:50,724 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 6723 transitions. Word has length 26 [2021-10-11 00:30:50,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:50,724 INFO L481 AbstractCegarLoop]: Abstraction has 4549 states and 6723 transitions. [2021-10-11 00:30:50,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 6723 transitions. [2021-10-11 00:30:50,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-11 00:30:50,730 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:50,730 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:50,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-11 00:30:50,731 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:50,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:50,732 INFO L82 PathProgramCache]: Analyzing trace with hash -331656060, now seen corresponding path program 1 times [2021-10-11 00:30:50,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:50,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230084661] [2021-10-11 00:30:50,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:50,754 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-11 00:30:50,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230084661] [2021-10-11 00:30:50,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:50,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:50,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139145377] [2021-10-11 00:30:50,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:50,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:50,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:50,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:50,756 INFO L87 Difference]: Start difference. First operand 4549 states and 6723 transitions. Second operand 3 states. [2021-10-11 00:30:50,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:50,878 INFO L93 Difference]: Finished difference Result 7945 states and 11973 transitions. [2021-10-11 00:30:50,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:50,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2021-10-11 00:30:50,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:50,896 INFO L225 Difference]: With dead ends: 7945 [2021-10-11 00:30:50,896 INFO L226 Difference]: Without dead ends: 7943 [2021-10-11 00:30:50,899 INFO L677 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-11 00:30:50,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7943 states. [2021-10-11 00:30:51,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7943 to 6661. [2021-10-11 00:30:51,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6661 states. [2021-10-11 00:30:51,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 9539 transitions. [2021-10-11 00:30:51,071 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 9539 transitions. Word has length 26 [2021-10-11 00:30:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:51,072 INFO L481 AbstractCegarLoop]: Abstraction has 6661 states and 9539 transitions. [2021-10-11 00:30:51,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 9539 transitions. [2021-10-11 00:30:51,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-11 00:30:51,081 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:51,082 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:51,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-11 00:30:51,082 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:51,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:51,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1611519738, now seen corresponding path program 1 times [2021-10-11 00:30:51,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:51,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145804319] [2021-10-11 00:30:51,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:51,127 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-11 00:30:51,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145804319] [2021-10-11 00:30:51,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:51,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:51,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110852480] [2021-10-11 00:30:51,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:51,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:51,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:51,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:51,129 INFO L87 Difference]: Start difference. First operand 6661 states and 9539 transitions. Second operand 3 states. [2021-10-11 00:30:51,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:51,262 INFO L93 Difference]: Finished difference Result 15369 states and 22085 transitions. [2021-10-11 00:30:51,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:51,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2021-10-11 00:30:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:51,280 INFO L225 Difference]: With dead ends: 15369 [2021-10-11 00:30:51,280 INFO L226 Difference]: Without dead ends: 8839 [2021-10-11 00:30:51,289 INFO L677 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-11 00:30:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8839 states. [2021-10-11 00:30:51,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8839 to 8837. [2021-10-11 00:30:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8837 states. [2021-10-11 00:30:51,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 12547 transitions. [2021-10-11 00:30:51,580 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 12547 transitions. Word has length 26 [2021-10-11 00:30:51,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:51,580 INFO L481 AbstractCegarLoop]: Abstraction has 8837 states and 12547 transitions. [2021-10-11 00:30:51,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:51,580 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 12547 transitions. [2021-10-11 00:30:51,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-11 00:30:51,590 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:51,590 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:51,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-11 00:30:51,591 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:51,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:51,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1691188181, now seen corresponding path program 1 times [2021-10-11 00:30:51,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:51,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912511306] [2021-10-11 00:30:51,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:51,615 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-11 00:30:51,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912511306] [2021-10-11 00:30:51,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:51,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:51,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319462459] [2021-10-11 00:30:51,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:51,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:51,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:51,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:51,621 INFO L87 Difference]: Start difference. First operand 8837 states and 12547 transitions. Second operand 3 states. [2021-10-11 00:30:51,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:51,721 INFO L93 Difference]: Finished difference Result 13257 states and 18757 transitions. [2021-10-11 00:30:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:51,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2021-10-11 00:30:51,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:51,739 INFO L225 Difference]: With dead ends: 13257 [2021-10-11 00:30:51,739 INFO L226 Difference]: Without dead ends: 8967 [2021-10-11 00:30:51,746 INFO L677 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-11 00:30:51,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8967 states. [2021-10-11 00:30:52,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8967 to 8965. [2021-10-11 00:30:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8965 states. [2021-10-11 00:30:52,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8965 states to 8965 states and 12547 transitions. [2021-10-11 00:30:52,098 INFO L78 Accepts]: Start accepts. Automaton has 8965 states and 12547 transitions. Word has length 27 [2021-10-11 00:30:52,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:52,098 INFO L481 AbstractCegarLoop]: Abstraction has 8965 states and 12547 transitions. [2021-10-11 00:30:52,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:52,098 INFO L276 IsEmpty]: Start isEmpty. Operand 8965 states and 12547 transitions. [2021-10-11 00:30:52,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-11 00:30:52,109 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:52,109 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:52,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-11 00:30:52,110 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:52,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:52,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1582710761, now seen corresponding path program 1 times [2021-10-11 00:30:52,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:52,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509858609] [2021-10-11 00:30:52,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:52,129 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-11 00:30:52,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509858609] [2021-10-11 00:30:52,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:52,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:52,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005806010] [2021-10-11 00:30:52,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:52,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:52,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:52,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:52,132 INFO L87 Difference]: Start difference. First operand 8965 states and 12547 transitions. Second operand 3 states. [2021-10-11 00:30:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:52,326 INFO L93 Difference]: Finished difference Result 15369 states and 21893 transitions. [2021-10-11 00:30:52,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:52,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2021-10-11 00:30:52,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:52,361 INFO L225 Difference]: With dead ends: 15369 [2021-10-11 00:30:52,361 INFO L226 Difference]: Without dead ends: 15367 [2021-10-11 00:30:52,367 INFO L677 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-11 00:30:52,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15367 states. [2021-10-11 00:30:52,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15367 to 13317. [2021-10-11 00:30:52,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13317 states. [2021-10-11 00:30:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13317 states to 13317 states and 18051 transitions. [2021-10-11 00:30:52,789 INFO L78 Accepts]: Start accepts. Automaton has 13317 states and 18051 transitions. Word has length 27 [2021-10-11 00:30:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:52,789 INFO L481 AbstractCegarLoop]: Abstraction has 13317 states and 18051 transitions. [2021-10-11 00:30:52,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 13317 states and 18051 transitions. [2021-10-11 00:30:52,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-11 00:30:52,809 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:52,810 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:52,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-11 00:30:52,810 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:52,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:52,811 INFO L82 PathProgramCache]: Analyzing trace with hash 302847083, now seen corresponding path program 1 times [2021-10-11 00:30:52,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:52,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436548922] [2021-10-11 00:30:52,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:52,828 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-11 00:30:52,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436548922] [2021-10-11 00:30:52,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:52,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:52,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124258254] [2021-10-11 00:30:52,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:52,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:52,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:52,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:52,831 INFO L87 Difference]: Start difference. First operand 13317 states and 18051 transitions. Second operand 3 states. [2021-10-11 00:30:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:53,121 INFO L93 Difference]: Finished difference Result 30473 states and 41349 transitions. [2021-10-11 00:30:53,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:53,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2021-10-11 00:30:53,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:53,151 INFO L225 Difference]: With dead ends: 30473 [2021-10-11 00:30:53,151 INFO L226 Difference]: Without dead ends: 17415 [2021-10-11 00:30:53,166 INFO L677 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-11 00:30:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17415 states. [2021-10-11 00:30:53,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17415 to 17413. [2021-10-11 00:30:53,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17413 states. [2021-10-11 00:30:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17413 states to 17413 states and 23299 transitions. [2021-10-11 00:30:53,583 INFO L78 Accepts]: Start accepts. Automaton has 17413 states and 23299 transitions. Word has length 27 [2021-10-11 00:30:53,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:53,584 INFO L481 AbstractCegarLoop]: Abstraction has 17413 states and 23299 transitions. [2021-10-11 00:30:53,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 17413 states and 23299 transitions. [2021-10-11 00:30:53,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-11 00:30:53,606 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:53,606 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:53,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-11 00:30:53,607 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:53,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:53,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1819608763, now seen corresponding path program 1 times [2021-10-11 00:30:53,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:53,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085667167] [2021-10-11 00:30:53,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:53,629 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-11 00:30:53,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085667167] [2021-10-11 00:30:53,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:53,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:53,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970578917] [2021-10-11 00:30:53,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:53,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:53,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:53,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:53,632 INFO L87 Difference]: Start difference. First operand 17413 states and 23299 transitions. Second operand 3 states. [2021-10-11 00:30:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:53,965 INFO L93 Difference]: Finished difference Result 26121 states and 34821 transitions. [2021-10-11 00:30:53,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:53,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2021-10-11 00:30:53,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:54,001 INFO L225 Difference]: With dead ends: 26121 [2021-10-11 00:30:54,001 INFO L226 Difference]: Without dead ends: 17671 [2021-10-11 00:30:54,012 INFO L677 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-11 00:30:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17671 states. [2021-10-11 00:30:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17671 to 17669. [2021-10-11 00:30:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17669 states. [2021-10-11 00:30:54,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17669 states to 17669 states and 23299 transitions. [2021-10-11 00:30:54,543 INFO L78 Accepts]: Start accepts. Automaton has 17669 states and 23299 transitions. Word has length 28 [2021-10-11 00:30:54,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:54,543 INFO L481 AbstractCegarLoop]: Abstraction has 17669 states and 23299 transitions. [2021-10-11 00:30:54,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:54,543 INFO L276 IsEmpty]: Start isEmpty. Operand 17669 states and 23299 transitions. [2021-10-11 00:30:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-11 00:30:54,565 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:54,565 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:54,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-11 00:30:54,566 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:54,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:54,567 INFO L82 PathProgramCache]: Analyzing trace with hash 798540409, now seen corresponding path program 1 times [2021-10-11 00:30:54,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:54,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538705425] [2021-10-11 00:30:54,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:54,593 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-11 00:30:54,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538705425] [2021-10-11 00:30:54,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:54,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:54,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685890823] [2021-10-11 00:30:54,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:54,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:54,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:54,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:54,595 INFO L87 Difference]: Start difference. First operand 17669 states and 23299 transitions. Second operand 3 states. [2021-10-11 00:30:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:54,997 INFO L93 Difference]: Finished difference Result 29705 states and 39685 transitions. [2021-10-11 00:30:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:54,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2021-10-11 00:30:54,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:55,048 INFO L225 Difference]: With dead ends: 29705 [2021-10-11 00:30:55,048 INFO L226 Difference]: Without dead ends: 29703 [2021-10-11 00:30:55,052 INFO L677 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-11 00:30:55,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29703 states. [2021-10-11 00:30:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29703 to 26629. [2021-10-11 00:30:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26629 states. [2021-10-11 00:30:55,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26629 states to 26629 states and 34051 transitions. [2021-10-11 00:30:55,704 INFO L78 Accepts]: Start accepts. Automaton has 26629 states and 34051 transitions. Word has length 28 [2021-10-11 00:30:55,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:55,704 INFO L481 AbstractCegarLoop]: Abstraction has 26629 states and 34051 transitions. [2021-10-11 00:30:55,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:55,704 INFO L276 IsEmpty]: Start isEmpty. Operand 26629 states and 34051 transitions. [2021-10-11 00:30:55,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-11 00:30:55,741 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:55,741 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:55,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-11 00:30:55,741 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:55,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:55,742 INFO L82 PathProgramCache]: Analyzing trace with hash -481323269, now seen corresponding path program 1 times [2021-10-11 00:30:55,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:55,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388149092] [2021-10-11 00:30:55,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:55,759 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-11 00:30:55,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388149092] [2021-10-11 00:30:55,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:55,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:55,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301758589] [2021-10-11 00:30:55,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:55,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:55,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:55,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:55,761 INFO L87 Difference]: Start difference. First operand 26629 states and 34051 transitions. Second operand 3 states. [2021-10-11 00:30:56,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:56,281 INFO L93 Difference]: Finished difference Result 60425 states and 77061 transitions. [2021-10-11 00:30:56,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:56,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2021-10-11 00:30:56,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:56,354 INFO L225 Difference]: With dead ends: 60425 [2021-10-11 00:30:56,355 INFO L226 Difference]: Without dead ends: 34311 [2021-10-11 00:30:56,383 INFO L677 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-11 00:30:56,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34311 states. [2021-10-11 00:30:57,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34311 to 34309. [2021-10-11 00:30:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34309 states. [2021-10-11 00:30:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34309 states to 34309 states and 43011 transitions. [2021-10-11 00:30:57,214 INFO L78 Accepts]: Start accepts. Automaton has 34309 states and 43011 transitions. Word has length 28 [2021-10-11 00:30:57,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:57,214 INFO L481 AbstractCegarLoop]: Abstraction has 34309 states and 43011 transitions. [2021-10-11 00:30:57,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:57,215 INFO L276 IsEmpty]: Start isEmpty. Operand 34309 states and 43011 transitions. [2021-10-11 00:30:57,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-11 00:30:57,268 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:57,269 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:57,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-11 00:30:57,269 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:57,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:57,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1014835328, now seen corresponding path program 1 times [2021-10-11 00:30:57,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:57,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128304622] [2021-10-11 00:30:57,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:57,291 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-11 00:30:57,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128304622] [2021-10-11 00:30:57,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:57,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:57,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590876232] [2021-10-11 00:30:57,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:57,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:57,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:57,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:57,294 INFO L87 Difference]: Start difference. First operand 34309 states and 43011 transitions. Second operand 3 states. [2021-10-11 00:30:57,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:57,742 INFO L93 Difference]: Finished difference Result 51465 states and 64261 transitions. [2021-10-11 00:30:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:57,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2021-10-11 00:30:57,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:57,793 INFO L225 Difference]: With dead ends: 51465 [2021-10-11 00:30:57,793 INFO L226 Difference]: Without dead ends: 34823 [2021-10-11 00:30:57,810 INFO L677 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-11 00:30:57,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34823 states. [2021-10-11 00:30:58,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34823 to 34821. [2021-10-11 00:30:58,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34821 states. [2021-10-11 00:30:58,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34821 states to 34821 states and 43011 transitions. [2021-10-11 00:30:58,718 INFO L78 Accepts]: Start accepts. Automaton has 34821 states and 43011 transitions. Word has length 29 [2021-10-11 00:30:58,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:30:58,719 INFO L481 AbstractCegarLoop]: Abstraction has 34821 states and 43011 transitions. [2021-10-11 00:30:58,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:30:58,719 INFO L276 IsEmpty]: Start isEmpty. Operand 34821 states and 43011 transitions. [2021-10-11 00:30:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-11 00:30:58,789 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:30:58,789 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:30:58,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-11 00:30:58,790 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:30:58,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:30:58,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2035903682, now seen corresponding path program 1 times [2021-10-11 00:30:58,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:30:58,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869485484] [2021-10-11 00:30:58,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:30:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:30:58,810 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-11 00:30:58,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869485484] [2021-10-11 00:30:58,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:30:58,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:30:58,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458254867] [2021-10-11 00:30:58,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:30:58,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:30:58,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:30:58,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:30:58,814 INFO L87 Difference]: Start difference. First operand 34821 states and 43011 transitions. Second operand 3 states. [2021-10-11 00:30:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:30:59,570 INFO L93 Difference]: Finished difference Result 101385 states and 122885 transitions. [2021-10-11 00:30:59,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:30:59,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2021-10-11 00:30:59,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:30:59,655 INFO L225 Difference]: With dead ends: 101385 [2021-10-11 00:30:59,655 INFO L226 Difference]: Without dead ends: 67591 [2021-10-11 00:30:59,685 INFO L677 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-11 00:30:59,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67591 states. [2021-10-11 00:31:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67591 to 67589. [2021-10-11 00:31:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67589 states. [2021-10-11 00:31:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67589 states to 67589 states and 79875 transitions. [2021-10-11 00:31:01,008 INFO L78 Accepts]: Start accepts. Automaton has 67589 states and 79875 transitions. Word has length 29 [2021-10-11 00:31:01,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:31:01,008 INFO L481 AbstractCegarLoop]: Abstraction has 67589 states and 79875 transitions. [2021-10-11 00:31:01,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:31:01,008 INFO L276 IsEmpty]: Start isEmpty. Operand 67589 states and 79875 transitions. [2021-10-11 00:31:01,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-11 00:31:01,297 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:31:01,297 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:01,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-11 00:31:01,298 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:31:01,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:01,298 INFO L82 PathProgramCache]: Analyzing trace with hash -756040004, now seen corresponding path program 1 times [2021-10-11 00:31:01,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:01,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554401484] [2021-10-11 00:31:01,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:01,346 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-11 00:31:01,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554401484] [2021-10-11 00:31:01,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:01,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:31:01,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835877453] [2021-10-11 00:31:01,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:31:01,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:01,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:31:01,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:31:01,348 INFO L87 Difference]: Start difference. First operand 67589 states and 79875 transitions. Second operand 3 states. [2021-10-11 00:31:01,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:01,997 INFO L93 Difference]: Finished difference Result 71689 states and 86021 transitions. [2021-10-11 00:31:01,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:31:01,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2021-10-11 00:31:01,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:31:02,281 INFO L225 Difference]: With dead ends: 71689 [2021-10-11 00:31:02,281 INFO L226 Difference]: Without dead ends: 71687 [2021-10-11 00:31:02,290 INFO L677 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-11 00:31:02,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71687 states. [2021-10-11 00:31:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71687 to 67589. [2021-10-11 00:31:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67589 states. [2021-10-11 00:31:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67589 states to 67589 states and 78851 transitions. [2021-10-11 00:31:03,423 INFO L78 Accepts]: Start accepts. Automaton has 67589 states and 78851 transitions. Word has length 29 [2021-10-11 00:31:03,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:31:03,424 INFO L481 AbstractCegarLoop]: Abstraction has 67589 states and 78851 transitions. [2021-10-11 00:31:03,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:31:03,424 INFO L276 IsEmpty]: Start isEmpty. Operand 67589 states and 78851 transitions. [2021-10-11 00:31:03,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-11 00:31:03,480 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:31:03,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:03,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-11 00:31:03,481 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:31:03,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:03,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1311711408, now seen corresponding path program 1 times [2021-10-11 00:31:03,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:03,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468502269] [2021-10-11 00:31:03,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:03,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-11 00:31:03,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468502269] [2021-10-11 00:31:03,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:03,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:31:03,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451530899] [2021-10-11 00:31:03,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:31:03,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:03,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:31:03,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:31:03,502 INFO L87 Difference]: Start difference. First operand 67589 states and 78851 transitions. Second operand 3 states. [2021-10-11 00:31:04,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:04,605 INFO L93 Difference]: Finished difference Result 109575 states and 126980 transitions. [2021-10-11 00:31:04,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:31:04,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2021-10-11 00:31:04,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:31:04,728 INFO L225 Difference]: With dead ends: 109575 [2021-10-11 00:31:04,728 INFO L226 Difference]: Without dead ends: 109573 [2021-10-11 00:31:04,748 INFO L677 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-11 00:31:04,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109573 states. [2021-10-11 00:31:06,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109573 to 105477. [2021-10-11 00:31:06,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105477 states. [2021-10-11 00:31:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105477 states to 105477 states and 120835 transitions. [2021-10-11 00:31:06,583 INFO L78 Accepts]: Start accepts. Automaton has 105477 states and 120835 transitions. Word has length 30 [2021-10-11 00:31:06,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:31:06,584 INFO L481 AbstractCegarLoop]: Abstraction has 105477 states and 120835 transitions. [2021-10-11 00:31:06,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:31:06,584 INFO L276 IsEmpty]: Start isEmpty. Operand 105477 states and 120835 transitions. [2021-10-11 00:31:06,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-11 00:31:06,662 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:31:06,662 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:06,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-11 00:31:06,662 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:31:06,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:06,663 INFO L82 PathProgramCache]: Analyzing trace with hash 31847730, now seen corresponding path program 1 times [2021-10-11 00:31:06,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:06,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348822379] [2021-10-11 00:31:06,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:06,681 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-11 00:31:06,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348822379] [2021-10-11 00:31:06,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:06,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:31:06,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017534678] [2021-10-11 00:31:06,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:31:06,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:06,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:31:06,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:31:06,684 INFO L87 Difference]: Start difference. First operand 105477 states and 120835 transitions. Second operand 3 states. [2021-10-11 00:31:07,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:07,945 INFO L93 Difference]: Finished difference Result 236549 states and 268291 transitions. [2021-10-11 00:31:07,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:31:07,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2021-10-11 00:31:07,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:31:07,946 INFO L225 Difference]: With dead ends: 236549 [2021-10-11 00:31:07,946 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 00:31:08,004 INFO L677 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-11 00:31:08,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 00:31:08,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 00:31:08,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 00:31:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 00:31:08,005 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2021-10-11 00:31:08,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:31:08,006 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:31:08,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:31:08,006 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 00:31:08,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 00:31:08,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-11 00:31:08,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 00:31:08,033 INFO L262 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2021-10-11 00:31:08,033 INFO L258 CegarLoopResult]: At program point L184-1(lines 7 193) the Hoare annotation is: false [2021-10-11 00:31:08,033 INFO L262 CegarLoopResult]: For program point L118-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,033 INFO L262 CegarLoopResult]: For program point L168-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,033 INFO L262 CegarLoopResult]: For program point L102-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,034 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-11 00:31:08,034 INFO L262 CegarLoopResult]: For program point L86-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,034 INFO L262 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2021-10-11 00:31:08,034 INFO L262 CegarLoopResult]: For program point L153-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,034 INFO L262 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2021-10-11 00:31:08,034 INFO L262 CegarLoopResult]: For program point L138-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,034 INFO L262 CegarLoopResult]: For program point L122-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,035 INFO L262 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2021-10-11 00:31:08,035 INFO L262 CegarLoopResult]: For program point L106-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,035 INFO L265 CegarLoopResult]: At program point L189(lines 7 193) the Hoare annotation is: true [2021-10-11 00:31:08,035 INFO L262 CegarLoopResult]: For program point L90-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,035 INFO L262 CegarLoopResult]: For program point L173-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,035 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 00:31:08,036 INFO L262 CegarLoopResult]: For program point L174(line 174) no Hoare annotation was computed. [2021-10-11 00:31:08,036 INFO L262 CegarLoopResult]: For program point L158-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,036 INFO L265 CegarLoopResult]: At program point L192(lines 6 193) the Hoare annotation is: true [2021-10-11 00:31:08,036 INFO L262 CegarLoopResult]: For program point L159(line 159) no Hoare annotation was computed. [2021-10-11 00:31:08,036 INFO L262 CegarLoopResult]: For program point L143-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,036 INFO L262 CegarLoopResult]: For program point L110-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,036 INFO L262 CegarLoopResult]: For program point L94-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,037 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-11 00:31:08,037 INFO L262 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2021-10-11 00:31:08,037 INFO L262 CegarLoopResult]: For program point L78(lines 78 80) no Hoare annotation was computed. [2021-10-11 00:31:08,037 INFO L262 CegarLoopResult]: For program point L78-2(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,038 INFO L262 CegarLoopResult]: For program point L128-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,038 INFO L262 CegarLoopResult]: For program point L178-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,038 INFO L262 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2021-10-11 00:31:08,039 INFO L262 CegarLoopResult]: For program point L179(line 179) no Hoare annotation was computed. [2021-10-11 00:31:08,039 INFO L262 CegarLoopResult]: For program point L163-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,039 INFO L262 CegarLoopResult]: For program point L114-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,039 INFO L262 CegarLoopResult]: For program point L164(line 164) no Hoare annotation was computed. [2021-10-11 00:31:08,039 INFO L262 CegarLoopResult]: For program point L98-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,039 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-11 00:31:08,039 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 191) no Hoare annotation was computed. [2021-10-11 00:31:08,040 INFO L262 CegarLoopResult]: For program point L148-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,040 INFO L262 CegarLoopResult]: For program point L49(lines 49 51) no Hoare annotation was computed. [2021-10-11 00:31:08,040 INFO L262 CegarLoopResult]: For program point L82-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,040 INFO L262 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2021-10-11 00:31:08,040 INFO L262 CegarLoopResult]: For program point L133-1(lines 47 188) no Hoare annotation was computed. [2021-10-11 00:31:08,040 INFO L265 CegarLoopResult]: At program point L183-1(lines 47 188) the Hoare annotation is: true [2021-10-11 00:31:08,041 INFO L262 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2021-10-11 00:31:08,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:31:08 BoogieIcfgContainer [2021-10-11 00:31:08,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 00:31:08,054 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 00:31:08,054 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 00:31:08,055 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 00:31:08,056 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:30:47" (3/4) ... [2021-10-11 00:31:08,060 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 00:31:08,078 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-11 00:31:08,079 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-11 00:31:08,079 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 00:31:08,079 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 00:31:08,127 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8e3b3fb-d0e5-49fb-bb2f-b43940dd5147/bin/uautomizer-Z5i5R5N3CC/witness.graphml [2021-10-11 00:31:08,127 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 00:31:08,129 INFO L168 Benchmark]: Toolchain (without parser) took 21760.44 ms. Allocated memory was 109.1 MB in the beginning and 11.1 GB in the end (delta: 11.0 GB). Free memory was 78.9 MB in the beginning and 9.6 GB in the end (delta: -9.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.1 GB. [2021-10-11 00:31:08,129 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 109.1 MB. Free memory is still 83.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:31:08,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.47 ms. Allocated memory is still 109.1 MB. Free memory was 78.8 MB in the beginning and 68.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-11 00:31:08,130 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.09 ms. Allocated memory is still 109.1 MB. Free memory was 68.0 MB in the beginning and 66.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:31:08,131 INFO L168 Benchmark]: Boogie Preprocessor took 27.49 ms. Allocated memory is still 109.1 MB. Free memory was 66.3 MB in the beginning and 64.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:31:08,131 INFO L168 Benchmark]: RCFGBuilder took 496.18 ms. Allocated memory was 109.1 MB in the beginning and 132.1 MB in the end (delta: 23.1 MB). Free memory was 64.8 MB in the beginning and 100.5 MB in the end (delta: -35.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 16.1 GB. [2021-10-11 00:31:08,132 INFO L168 Benchmark]: TraceAbstraction took 20819.20 ms. Allocated memory was 132.1 MB in the beginning and 11.1 GB in the end (delta: 11.0 GB). Free memory was 99.9 MB in the beginning and 9.6 GB in the end (delta: -9.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.1 GB. [2021-10-11 00:31:08,132 INFO L168 Benchmark]: Witness Printer took 72.85 ms. Allocated memory is still 11.1 GB. Free memory was 9.6 GB in the beginning and 9.6 GB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 00:31:08,134 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.57 ms. Allocated memory is still 109.1 MB. Free memory is still 83.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 297.47 ms. Allocated memory is still 109.1 MB. Free memory was 78.8 MB in the beginning and 68.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.09 ms. Allocated memory is still 109.1 MB. Free memory was 68.0 MB in the beginning and 66.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.49 ms. Allocated memory is still 109.1 MB. Free memory was 66.3 MB in the beginning and 64.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 496.18 ms. Allocated memory was 109.1 MB in the beginning and 132.1 MB in the end (delta: 23.1 MB). Free memory was 64.8 MB in the beginning and 100.5 MB in the end (delta: -35.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20819.20 ms. Allocated memory was 132.1 MB in the beginning and 11.1 GB in the end (delta: 11.0 GB). Free memory was 99.9 MB in the beginning and 9.6 GB in the end (delta: -9.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.1 GB. * Witness Printer took 72.85 ms. Allocated memory is still 11.1 GB. Free memory was 9.6 GB in the beginning and 9.6 GB 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: - PositiveResult [Line: 191]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 20.7s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3231 SDtfs, 1629 SDslu, 2174 SDs, 0 SdLazy, 175 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105477occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.7s AutomataMinimizationTime, 33 MinimizatonAttempts, 16418 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 4105 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 811 NumberOfCodeBlocks, 811 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 778 ConstructedInterpolants, 0 QuantifiedInterpolants, 40508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...