./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/bin/uautomizer-WNIpwEf4Nt --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a93221bc263791497331acd2a7a0150037c621aa ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 01:15:07,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 01:15:07,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 01:15:07,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 01:15:07,867 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 01:15:07,868 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 01:15:07,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 01:15:07,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 01:15:07,875 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 01:15:07,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 01:15:07,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 01:15:07,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 01:15:07,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 01:15:07,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 01:15:07,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 01:15:07,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 01:15:07,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 01:15:07,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 01:15:07,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 01:15:07,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 01:15:07,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 01:15:07,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 01:15:07,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 01:15:07,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 01:15:07,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 01:15:07,906 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 01:15:07,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 01:15:07,908 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 01:15:07,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 01:15:07,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 01:15:07,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 01:15:07,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 01:15:07,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 01:15:07,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 01:15:07,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 01:15:07,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 01:15:07,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 01:15:07,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 01:15:07,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 01:15:07,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 01:15:07,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 01:15:07,922 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 01:15:07,961 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 01:15:07,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 01:15:07,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 01:15:07,964 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 01:15:07,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 01:15:07,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 01:15:07,967 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 01:15:07,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 01:15:07,967 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 01:15:07,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 01:15:07,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 01:15:07,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 01:15:07,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 01:15:07,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 01:15:07,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 01:15:07,971 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 01:15:07,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 01:15:07,971 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 01:15:07,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 01:15:07,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 01:15:07,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 01:15:07,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 01:15:07,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:15:07,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 01:15:07,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 01:15:07,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 01:15:07,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 01:15:07,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 01:15:07,974 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 01:15:07,976 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 01:15:07,976 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_31b1a696-dd73-4c5a-8040-e09a37618990/bin/uautomizer-WNIpwEf4Nt/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/bin/uautomizer-WNIpwEf4Nt Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a93221bc263791497331acd2a7a0150037c621aa [2021-10-13 01:15:08,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 01:15:08,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 01:15:08,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 01:15:08,382 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 01:15:08,383 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 01:15:08,384 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/locks/test_locks_11.c [2021-10-13 01:15:08,475 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/bin/uautomizer-WNIpwEf4Nt/data/0c17c4e31/20420bfaad3449f798740e47965df161/FLAG92ff26608 [2021-10-13 01:15:08,944 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 01:15:08,949 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/sv-benchmarks/c/locks/test_locks_11.c [2021-10-13 01:15:08,969 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/bin/uautomizer-WNIpwEf4Nt/data/0c17c4e31/20420bfaad3449f798740e47965df161/FLAG92ff26608 [2021-10-13 01:15:09,316 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/bin/uautomizer-WNIpwEf4Nt/data/0c17c4e31/20420bfaad3449f798740e47965df161 [2021-10-13 01:15:09,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 01:15:09,321 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 01:15:09,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 01:15:09,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 01:15:09,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 01:15:09,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:15:09" (1/1) ... [2021-10-13 01:15:09,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c83019e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:09, skipping insertion in model container [2021-10-13 01:15:09,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:15:09" (1/1) ... [2021-10-13 01:15:09,355 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 01:15:09,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 01:15:09,567 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2021-10-13 01:15:09,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:15:09,581 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 01:15:09,608 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2021-10-13 01:15:09,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:15:09,624 INFO L208 MainTranslator]: Completed translation [2021-10-13 01:15:09,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:09 WrapperNode [2021-10-13 01:15:09,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 01:15:09,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 01:15:09,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 01:15:09,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 01:15:09,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:09" (1/1) ... [2021-10-13 01:15:09,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:09" (1/1) ... [2021-10-13 01:15:09,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 01:15:09,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 01:15:09,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 01:15:09,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 01:15:09,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:09" (1/1) ... [2021-10-13 01:15:09,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:09" (1/1) ... [2021-10-13 01:15:09,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:09" (1/1) ... [2021-10-13 01:15:09,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:09" (1/1) ... [2021-10-13 01:15:09,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:09" (1/1) ... [2021-10-13 01:15:09,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:09" (1/1) ... [2021-10-13 01:15:09,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:09" (1/1) ... [2021-10-13 01:15:09,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 01:15:09,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 01:15:09,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 01:15:09,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 01:15:09,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:09" (1/1) ... [2021-10-13 01:15:09,733 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:15:09,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:15:09,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 01:15:09,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 01:15:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 01:15:09,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 01:15:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 01:15:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 01:15:10,297 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 01:15:10,298 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-13 01:15:10,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:15:10 BoogieIcfgContainer [2021-10-13 01:15:10,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 01:15:10,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 01:15:10,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 01:15:10,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 01:15:10,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:15:09" (1/3) ... [2021-10-13 01:15:10,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e072720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:15:10, skipping insertion in model container [2021-10-13 01:15:10,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:15:09" (2/3) ... [2021-10-13 01:15:10,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e072720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:15:10, skipping insertion in model container [2021-10-13 01:15:10,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:15:10" (3/3) ... [2021-10-13 01:15:10,310 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2021-10-13 01:15:10,316 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 01:15:10,317 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 01:15:10,364 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 01:15:10,371 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 01:15:10,371 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 01:15:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 01:15:10,394 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:10,394 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:10,395 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:10,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:10,401 INFO L82 PathProgramCache]: Analyzing trace with hash 458919617, now seen corresponding path program 1 times [2021-10-13 01:15:10,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:10,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252235809] [2021-10-13 01:15:10,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:10,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:10,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:10,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252235809] [2021-10-13 01:15:10,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252235809] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:10,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:10,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:10,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360253198] [2021-10-13 01:15:10,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:10,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:10,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:10,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:10,799 INFO L87 Difference]: Start difference. First operand has 43 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:10,892 INFO L93 Difference]: Finished difference Result 89 states and 157 transitions. [2021-10-13 01:15:10,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:10,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-13 01:15:10,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:10,912 INFO L225 Difference]: With dead ends: 89 [2021-10-13 01:15:10,912 INFO L226 Difference]: Without dead ends: 75 [2021-10-13 01:15:10,915 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:10,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-10-13 01:15:10,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 51. [2021-10-13 01:15:10,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.88) internal successors, (94), 50 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 94 transitions. [2021-10-13 01:15:10,974 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 94 transitions. Word has length 18 [2021-10-13 01:15:10,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:10,976 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 94 transitions. [2021-10-13 01:15:10,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:10,976 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 94 transitions. [2021-10-13 01:15:10,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 01:15:10,978 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:10,978 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:10,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 01:15:10,979 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:10,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:10,983 INFO L82 PathProgramCache]: Analyzing trace with hash -552197633, now seen corresponding path program 1 times [2021-10-13 01:15:10,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:10,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026362454] [2021-10-13 01:15:10,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:10,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:11,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:11,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026362454] [2021-10-13 01:15:11,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026362454] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:11,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:11,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:11,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107015485] [2021-10-13 01:15:11,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:11,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:11,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:11,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:11,088 INFO L87 Difference]: Start difference. First operand 51 states and 94 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:11,125 INFO L93 Difference]: Finished difference Result 124 states and 229 transitions. [2021-10-13 01:15:11,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:11,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-13 01:15:11,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:11,130 INFO L225 Difference]: With dead ends: 124 [2021-10-13 01:15:11,131 INFO L226 Difference]: Without dead ends: 75 [2021-10-13 01:15:11,132 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:11,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-10-13 01:15:11,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2021-10-13 01:15:11,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 134 transitions. [2021-10-13 01:15:11,142 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 134 transitions. Word has length 18 [2021-10-13 01:15:11,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:11,143 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 134 transitions. [2021-10-13 01:15:11,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,143 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 134 transitions. [2021-10-13 01:15:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 01:15:11,144 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:11,145 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:11,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 01:15:11,145 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:11,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:11,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1341819263, now seen corresponding path program 1 times [2021-10-13 01:15:11,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:11,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879897909] [2021-10-13 01:15:11,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:11,147 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:11,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:11,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:11,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879897909] [2021-10-13 01:15:11,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879897909] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:11,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:11,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:11,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998733865] [2021-10-13 01:15:11,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:11,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:11,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:11,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:11,250 INFO L87 Difference]: Start difference. First operand 73 states and 134 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:11,275 INFO L93 Difference]: Finished difference Result 114 states and 204 transitions. [2021-10-13 01:15:11,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:11,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 01:15:11,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:11,279 INFO L225 Difference]: With dead ends: 114 [2021-10-13 01:15:11,282 INFO L226 Difference]: Without dead ends: 78 [2021-10-13 01:15:11,283 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:11,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-10-13 01:15:11,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2021-10-13 01:15:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 75 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 136 transitions. [2021-10-13 01:15:11,308 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 136 transitions. Word has length 19 [2021-10-13 01:15:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:11,309 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 136 transitions. [2021-10-13 01:15:11,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,310 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 136 transitions. [2021-10-13 01:15:11,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 01:15:11,311 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:11,311 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:11,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 01:15:11,312 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:11,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:11,315 INFO L82 PathProgramCache]: Analyzing trace with hash 61955585, now seen corresponding path program 1 times [2021-10-13 01:15:11,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:11,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388051498] [2021-10-13 01:15:11,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:11,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:11,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:11,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388051498] [2021-10-13 01:15:11,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388051498] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:11,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:11,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:11,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55215532] [2021-10-13 01:15:11,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:11,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:11,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:11,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:11,400 INFO L87 Difference]: Start difference. First operand 76 states and 136 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:11,433 INFO L93 Difference]: Finished difference Result 145 states and 261 transitions. [2021-10-13 01:15:11,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:11,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 01:15:11,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:11,446 INFO L225 Difference]: With dead ends: 145 [2021-10-13 01:15:11,446 INFO L226 Difference]: Without dead ends: 143 [2021-10-13 01:15:11,447 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:11,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-10-13 01:15:11,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101. [2021-10-13 01:15:11,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.81) internal successors, (181), 100 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 181 transitions. [2021-10-13 01:15:11,478 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 181 transitions. Word has length 19 [2021-10-13 01:15:11,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:11,479 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 181 transitions. [2021-10-13 01:15:11,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,479 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 181 transitions. [2021-10-13 01:15:11,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 01:15:11,480 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:11,481 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:11,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 01:15:11,481 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:11,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:11,482 INFO L82 PathProgramCache]: Analyzing trace with hash -949161665, now seen corresponding path program 1 times [2021-10-13 01:15:11,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:11,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911876699] [2021-10-13 01:15:11,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:11,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:11,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:11,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:11,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911876699] [2021-10-13 01:15:11,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911876699] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:11,570 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:11,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:11,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53722898] [2021-10-13 01:15:11,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:11,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:11,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:11,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:11,573 INFO L87 Difference]: Start difference. First operand 101 states and 181 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:11,601 INFO L93 Difference]: Finished difference Result 241 states and 435 transitions. [2021-10-13 01:15:11,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:11,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 01:15:11,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:11,604 INFO L225 Difference]: With dead ends: 241 [2021-10-13 01:15:11,604 INFO L226 Difference]: Without dead ends: 145 [2021-10-13 01:15:11,605 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:11,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-10-13 01:15:11,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2021-10-13 01:15:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.795774647887324) internal successors, (255), 142 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 255 transitions. [2021-10-13 01:15:11,619 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 255 transitions. Word has length 19 [2021-10-13 01:15:11,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:11,619 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 255 transitions. [2021-10-13 01:15:11,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 255 transitions. [2021-10-13 01:15:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 01:15:11,621 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:11,621 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:11,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 01:15:11,621 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:11,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:11,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1920836500, now seen corresponding path program 1 times [2021-10-13 01:15:11,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:11,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915877302] [2021-10-13 01:15:11,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:11,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:11,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:11,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915877302] [2021-10-13 01:15:11,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915877302] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:11,689 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:11,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:11,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486164552] [2021-10-13 01:15:11,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:11,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:11,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:11,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:11,691 INFO L87 Difference]: Start difference. First operand 143 states and 255 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:11,706 INFO L93 Difference]: Finished difference Result 216 states and 382 transitions. [2021-10-13 01:15:11,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:11,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-13 01:15:11,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:11,708 INFO L225 Difference]: With dead ends: 216 [2021-10-13 01:15:11,708 INFO L226 Difference]: Without dead ends: 147 [2021-10-13 01:15:11,709 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-10-13 01:15:11,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2021-10-13 01:15:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 144 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 255 transitions. [2021-10-13 01:15:11,739 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 255 transitions. Word has length 20 [2021-10-13 01:15:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:11,739 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 255 transitions. [2021-10-13 01:15:11,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 255 transitions. [2021-10-13 01:15:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 01:15:11,740 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:11,741 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:11,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 01:15:11,741 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:11,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:11,742 INFO L82 PathProgramCache]: Analyzing trace with hash 640972822, now seen corresponding path program 1 times [2021-10-13 01:15:11,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:11,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247300026] [2021-10-13 01:15:11,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:11,743 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:11,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:11,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247300026] [2021-10-13 01:15:11,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247300026] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:11,835 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:11,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:11,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591456154] [2021-10-13 01:15:11,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:11,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:11,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:11,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:11,837 INFO L87 Difference]: Start difference. First operand 145 states and 255 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:11,861 INFO L93 Difference]: Finished difference Result 417 states and 737 transitions. [2021-10-13 01:15:11,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:11,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-13 01:15:11,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:11,865 INFO L225 Difference]: With dead ends: 417 [2021-10-13 01:15:11,865 INFO L226 Difference]: Without dead ends: 279 [2021-10-13 01:15:11,866 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:11,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-10-13 01:15:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2021-10-13 01:15:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.75) internal successors, (483), 276 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 483 transitions. [2021-10-13 01:15:11,907 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 483 transitions. Word has length 20 [2021-10-13 01:15:11,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:11,908 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 483 transitions. [2021-10-13 01:15:11,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 483 transitions. [2021-10-13 01:15:11,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 01:15:11,915 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:11,916 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:11,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 01:15:11,916 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:11,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:11,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1652090072, now seen corresponding path program 1 times [2021-10-13 01:15:11,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:11,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877309165] [2021-10-13 01:15:11,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:11,918 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:11,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:11,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877309165] [2021-10-13 01:15:11,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877309165] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:11,958 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:11,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:11,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252905083] [2021-10-13 01:15:11,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:11,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:11,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:11,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:11,960 INFO L87 Difference]: Start difference. First operand 277 states and 483 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:11,978 INFO L93 Difference]: Finished difference Result 353 states and 621 transitions. [2021-10-13 01:15:11,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:11,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-13 01:15:11,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:11,981 INFO L225 Difference]: With dead ends: 353 [2021-10-13 01:15:11,982 INFO L226 Difference]: Without dead ends: 351 [2021-10-13 01:15:11,982 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:11,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2021-10-13 01:15:11,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 277. [2021-10-13 01:15:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.7355072463768115) internal successors, (479), 276 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 479 transitions. [2021-10-13 01:15:11,998 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 479 transitions. Word has length 20 [2021-10-13 01:15:11,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:11,998 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 479 transitions. [2021-10-13 01:15:11,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:11,999 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 479 transitions. [2021-10-13 01:15:12,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 01:15:12,001 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:12,001 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:12,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 01:15:12,001 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:12,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:12,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1604465292, now seen corresponding path program 1 times [2021-10-13 01:15:12,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:12,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765946076] [2021-10-13 01:15:12,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:12,003 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:12,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:12,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765946076] [2021-10-13 01:15:12,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765946076] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:12,049 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:12,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:12,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471815345] [2021-10-13 01:15:12,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:12,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:12,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:12,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:12,054 INFO L87 Difference]: Start difference. First operand 277 states and 479 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:12,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:12,090 INFO L93 Difference]: Finished difference Result 517 states and 905 transitions. [2021-10-13 01:15:12,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:12,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-13 01:15:12,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:12,098 INFO L225 Difference]: With dead ends: 517 [2021-10-13 01:15:12,098 INFO L226 Difference]: Without dead ends: 515 [2021-10-13 01:15:12,102 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:12,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-10-13 01:15:12,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 385. [2021-10-13 01:15:12,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.7057291666666667) internal successors, (655), 384 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 655 transitions. [2021-10-13 01:15:12,132 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 655 transitions. Word has length 21 [2021-10-13 01:15:12,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:12,133 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 655 transitions. [2021-10-13 01:15:12,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:12,133 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 655 transitions. [2021-10-13 01:15:12,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 01:15:12,136 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:12,136 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:12,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 01:15:12,137 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:12,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:12,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1679384754, now seen corresponding path program 1 times [2021-10-13 01:15:12,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:12,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407235742] [2021-10-13 01:15:12,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:12,149 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:12,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:12,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407235742] [2021-10-13 01:15:12,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407235742] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:12,204 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:12,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:12,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311171061] [2021-10-13 01:15:12,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:12,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:12,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:12,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:12,207 INFO L87 Difference]: Start difference. First operand 385 states and 655 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:12,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:12,240 INFO L93 Difference]: Finished difference Result 917 states and 1569 transitions. [2021-10-13 01:15:12,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:12,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-13 01:15:12,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:12,245 INFO L225 Difference]: With dead ends: 917 [2021-10-13 01:15:12,245 INFO L226 Difference]: Without dead ends: 539 [2021-10-13 01:15:12,249 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:12,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-10-13 01:15:12,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 537. [2021-10-13 01:15:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.6921641791044777) internal successors, (907), 536 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 907 transitions. [2021-10-13 01:15:12,278 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 907 transitions. Word has length 21 [2021-10-13 01:15:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:12,279 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 907 transitions. [2021-10-13 01:15:12,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:12,279 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 907 transitions. [2021-10-13 01:15:12,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 01:15:12,285 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:12,285 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:12,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 01:15:12,286 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:12,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:12,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1801397547, now seen corresponding path program 1 times [2021-10-13 01:15:12,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:12,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103794148] [2021-10-13 01:15:12,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:12,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:12,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:12,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:12,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103794148] [2021-10-13 01:15:12,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103794148] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:12,352 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:12,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:12,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427295388] [2021-10-13 01:15:12,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:12,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:12,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:12,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:12,356 INFO L87 Difference]: Start difference. First operand 537 states and 907 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:12,405 INFO L93 Difference]: Finished difference Result 813 states and 1369 transitions. [2021-10-13 01:15:12,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:12,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 01:15:12,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:12,410 INFO L225 Difference]: With dead ends: 813 [2021-10-13 01:15:12,410 INFO L226 Difference]: Without dead ends: 551 [2021-10-13 01:15:12,411 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:12,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2021-10-13 01:15:12,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549. [2021-10-13 01:15:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 915 transitions. [2021-10-13 01:15:12,432 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 915 transitions. Word has length 22 [2021-10-13 01:15:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:12,432 INFO L470 AbstractCegarLoop]: Abstraction has 549 states and 915 transitions. [2021-10-13 01:15:12,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:12,432 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 915 transitions. [2021-10-13 01:15:12,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 01:15:12,434 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:12,440 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:12,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 01:15:12,441 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:12,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:12,442 INFO L82 PathProgramCache]: Analyzing trace with hash 521533869, now seen corresponding path program 1 times [2021-10-13 01:15:12,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:12,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618768961] [2021-10-13 01:15:12,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:12,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:12,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:12,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:12,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618768961] [2021-10-13 01:15:12,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618768961] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:12,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:12,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:12,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813917032] [2021-10-13 01:15:12,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:12,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:12,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:12,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:12,513 INFO L87 Difference]: Start difference. First operand 549 states and 915 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:12,549 INFO L93 Difference]: Finished difference Result 1001 states and 1693 transitions. [2021-10-13 01:15:12,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:12,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 01:15:12,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:12,558 INFO L225 Difference]: With dead ends: 1001 [2021-10-13 01:15:12,559 INFO L226 Difference]: Without dead ends: 999 [2021-10-13 01:15:12,564 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:12,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2021-10-13 01:15:12,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 773. [2021-10-13 01:15:12,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:12,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1259 transitions. [2021-10-13 01:15:12,594 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1259 transitions. Word has length 22 [2021-10-13 01:15:12,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:12,595 INFO L470 AbstractCegarLoop]: Abstraction has 773 states and 1259 transitions. [2021-10-13 01:15:12,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:12,595 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1259 transitions. [2021-10-13 01:15:12,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 01:15:12,601 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:12,601 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:12,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 01:15:12,602 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:12,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:12,602 INFO L82 PathProgramCache]: Analyzing trace with hash -489583381, now seen corresponding path program 1 times [2021-10-13 01:15:12,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:12,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887904917] [2021-10-13 01:15:12,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:12,603 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:12,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:12,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887904917] [2021-10-13 01:15:12,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887904917] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:12,654 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:12,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:12,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031562713] [2021-10-13 01:15:12,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:12,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:12,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:12,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:12,657 INFO L87 Difference]: Start difference. First operand 773 states and 1259 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:12,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:12,693 INFO L93 Difference]: Finished difference Result 1817 states and 2973 transitions. [2021-10-13 01:15:12,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:12,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 01:15:12,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:12,701 INFO L225 Difference]: With dead ends: 1817 [2021-10-13 01:15:12,701 INFO L226 Difference]: Without dead ends: 1063 [2021-10-13 01:15:12,703 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:12,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2021-10-13 01:15:12,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1061. [2021-10-13 01:15:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1715 transitions. [2021-10-13 01:15:12,745 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1715 transitions. Word has length 22 [2021-10-13 01:15:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:12,746 INFO L470 AbstractCegarLoop]: Abstraction has 1061 states and 1715 transitions. [2021-10-13 01:15:12,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1715 transitions. [2021-10-13 01:15:12,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 01:15:12,748 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:12,748 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:12,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 01:15:12,749 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:12,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:12,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1012104857, now seen corresponding path program 1 times [2021-10-13 01:15:12,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:12,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253663967] [2021-10-13 01:15:12,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:12,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:12,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:12,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253663967] [2021-10-13 01:15:12,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253663967] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:12,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:12,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:12,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056066277] [2021-10-13 01:15:12,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:12,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:12,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:12,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:12,800 INFO L87 Difference]: Start difference. First operand 1061 states and 1715 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:12,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:12,833 INFO L93 Difference]: Finished difference Result 1593 states and 2565 transitions. [2021-10-13 01:15:12,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:12,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-13 01:15:12,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:12,844 INFO L225 Difference]: With dead ends: 1593 [2021-10-13 01:15:12,844 INFO L226 Difference]: Without dead ends: 1079 [2021-10-13 01:15:12,846 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:12,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2021-10-13 01:15:12,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1077. [2021-10-13 01:15:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1715 transitions. [2021-10-13 01:15:12,886 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1715 transitions. Word has length 23 [2021-10-13 01:15:12,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:12,888 INFO L470 AbstractCegarLoop]: Abstraction has 1077 states and 1715 transitions. [2021-10-13 01:15:12,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:12,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1715 transitions. [2021-10-13 01:15:12,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 01:15:12,890 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:12,890 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:12,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 01:15:12,891 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:12,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:12,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2002998761, now seen corresponding path program 1 times [2021-10-13 01:15:12,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:12,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317671189] [2021-10-13 01:15:12,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:12,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:12,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:12,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317671189] [2021-10-13 01:15:12,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317671189] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:12,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:12,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:12,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804809536] [2021-10-13 01:15:12,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:12,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:12,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:12,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:12,931 INFO L87 Difference]: Start difference. First operand 1077 states and 1715 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:12,975 INFO L93 Difference]: Finished difference Result 1929 states and 3125 transitions. [2021-10-13 01:15:12,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:12,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-13 01:15:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:12,989 INFO L225 Difference]: With dead ends: 1929 [2021-10-13 01:15:12,989 INFO L226 Difference]: Without dead ends: 1927 [2021-10-13 01:15:12,992 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:12,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2021-10-13 01:15:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1541. [2021-10-13 01:15:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2387 transitions. [2021-10-13 01:15:13,056 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2387 transitions. Word has length 23 [2021-10-13 01:15:13,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:13,057 INFO L470 AbstractCegarLoop]: Abstraction has 1541 states and 2387 transitions. [2021-10-13 01:15:13,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:13,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2387 transitions. [2021-10-13 01:15:13,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 01:15:13,060 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:13,060 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:13,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 01:15:13,061 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:13,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:13,062 INFO L82 PathProgramCache]: Analyzing trace with hash 991881511, now seen corresponding path program 1 times [2021-10-13 01:15:13,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:13,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428214726] [2021-10-13 01:15:13,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:13,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:13,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:13,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:13,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428214726] [2021-10-13 01:15:13,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428214726] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:13,098 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:13,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:13,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672429272] [2021-10-13 01:15:13,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:13,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:13,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:13,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:13,100 INFO L87 Difference]: Start difference. First operand 1541 states and 2387 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:13,150 INFO L93 Difference]: Finished difference Result 3593 states and 5589 transitions. [2021-10-13 01:15:13,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:13,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-13 01:15:13,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:13,165 INFO L225 Difference]: With dead ends: 3593 [2021-10-13 01:15:13,165 INFO L226 Difference]: Without dead ends: 2087 [2021-10-13 01:15:13,170 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:13,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2021-10-13 01:15:13,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 2085. [2021-10-13 01:15:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 3203 transitions. [2021-10-13 01:15:13,255 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 3203 transitions. Word has length 23 [2021-10-13 01:15:13,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:13,256 INFO L470 AbstractCegarLoop]: Abstraction has 2085 states and 3203 transitions. [2021-10-13 01:15:13,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:13,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 3203 transitions. [2021-10-13 01:15:13,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 01:15:13,259 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:13,259 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:13,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 01:15:13,259 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:13,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:13,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1963634176, now seen corresponding path program 1 times [2021-10-13 01:15:13,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:13,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888198003] [2021-10-13 01:15:13,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:13,261 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:13,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:13,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888198003] [2021-10-13 01:15:13,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888198003] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:13,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:13,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:13,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333166413] [2021-10-13 01:15:13,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:13,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:13,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:13,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:13,300 INFO L87 Difference]: Start difference. First operand 2085 states and 3203 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:13,345 INFO L93 Difference]: Finished difference Result 3129 states and 4789 transitions. [2021-10-13 01:15:13,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:13,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 01:15:13,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:13,360 INFO L225 Difference]: With dead ends: 3129 [2021-10-13 01:15:13,360 INFO L226 Difference]: Without dead ends: 2119 [2021-10-13 01:15:13,362 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2021-10-13 01:15:13,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2117. [2021-10-13 01:15:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3203 transitions. [2021-10-13 01:15:13,448 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3203 transitions. Word has length 24 [2021-10-13 01:15:13,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:13,448 INFO L470 AbstractCegarLoop]: Abstraction has 2117 states and 3203 transitions. [2021-10-13 01:15:13,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3203 transitions. [2021-10-13 01:15:13,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 01:15:13,451 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:13,451 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:13,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 01:15:13,452 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:13,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:13,452 INFO L82 PathProgramCache]: Analyzing trace with hash 683770498, now seen corresponding path program 1 times [2021-10-13 01:15:13,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:13,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600326512] [2021-10-13 01:15:13,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:13,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:13,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:13,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600326512] [2021-10-13 01:15:13,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600326512] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:13,489 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:13,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:13,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710636095] [2021-10-13 01:15:13,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:13,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:13,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:13,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:13,492 INFO L87 Difference]: Start difference. First operand 2117 states and 3203 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:13,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:13,561 INFO L93 Difference]: Finished difference Result 3721 states and 5733 transitions. [2021-10-13 01:15:13,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:13,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 01:15:13,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:13,585 INFO L225 Difference]: With dead ends: 3721 [2021-10-13 01:15:13,585 INFO L226 Difference]: Without dead ends: 3719 [2021-10-13 01:15:13,587 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:13,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2021-10-13 01:15:13,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3077. [2021-10-13 01:15:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:13,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4515 transitions. [2021-10-13 01:15:13,697 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4515 transitions. Word has length 24 [2021-10-13 01:15:13,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:13,697 INFO L470 AbstractCegarLoop]: Abstraction has 3077 states and 4515 transitions. [2021-10-13 01:15:13,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:13,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4515 transitions. [2021-10-13 01:15:13,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 01:15:13,702 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:13,702 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:13,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 01:15:13,703 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:13,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:13,703 INFO L82 PathProgramCache]: Analyzing trace with hash -327346752, now seen corresponding path program 1 times [2021-10-13 01:15:13,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:13,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66671098] [2021-10-13 01:15:13,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:13,704 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:13,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:13,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:13,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66671098] [2021-10-13 01:15:13,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66671098] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:13,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:13,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:13,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143695029] [2021-10-13 01:15:13,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:13,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:13,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:13,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:13,748 INFO L87 Difference]: Start difference. First operand 3077 states and 4515 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:13,835 INFO L93 Difference]: Finished difference Result 7113 states and 10469 transitions. [2021-10-13 01:15:13,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:13,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 01:15:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:13,861 INFO L225 Difference]: With dead ends: 7113 [2021-10-13 01:15:13,861 INFO L226 Difference]: Without dead ends: 4103 [2021-10-13 01:15:13,865 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2021-10-13 01:15:13,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 4101. [2021-10-13 01:15:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:14,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5955 transitions. [2021-10-13 01:15:14,011 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5955 transitions. Word has length 24 [2021-10-13 01:15:14,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:14,011 INFO L470 AbstractCegarLoop]: Abstraction has 4101 states and 5955 transitions. [2021-10-13 01:15:14,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:14,012 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5955 transitions. [2021-10-13 01:15:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 01:15:14,016 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:14,016 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:14,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 01:15:14,017 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:14,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:14,017 INFO L82 PathProgramCache]: Analyzing trace with hash -277735972, now seen corresponding path program 1 times [2021-10-13 01:15:14,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:14,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108561203] [2021-10-13 01:15:14,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:14,018 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:14,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:14,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:14,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108561203] [2021-10-13 01:15:14,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108561203] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:14,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:14,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:14,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093665177] [2021-10-13 01:15:14,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:14,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:14,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:14,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:14,044 INFO L87 Difference]: Start difference. First operand 4101 states and 5955 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:14,161 INFO L93 Difference]: Finished difference Result 6153 states and 8901 transitions. [2021-10-13 01:15:14,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:14,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-13 01:15:14,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:14,187 INFO L225 Difference]: With dead ends: 6153 [2021-10-13 01:15:14,187 INFO L226 Difference]: Without dead ends: 4167 [2021-10-13 01:15:14,190 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4167 states. [2021-10-13 01:15:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4167 to 4165. [2021-10-13 01:15:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:14,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4165 states to 4165 states and 5955 transitions. [2021-10-13 01:15:14,340 INFO L78 Accepts]: Start accepts. Automaton has 4165 states and 5955 transitions. Word has length 25 [2021-10-13 01:15:14,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:14,340 INFO L470 AbstractCegarLoop]: Abstraction has 4165 states and 5955 transitions. [2021-10-13 01:15:14,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:14,341 INFO L276 IsEmpty]: Start isEmpty. Operand 4165 states and 5955 transitions. [2021-10-13 01:15:14,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 01:15:14,345 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:14,345 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:14,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 01:15:14,346 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:14,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:14,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1557599650, now seen corresponding path program 1 times [2021-10-13 01:15:14,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:14,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402629137] [2021-10-13 01:15:14,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:14,347 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:14,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:14,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:14,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402629137] [2021-10-13 01:15:14,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402629137] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:14,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:14,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:14,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662184762] [2021-10-13 01:15:14,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:14,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:14,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:14,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:14,372 INFO L87 Difference]: Start difference. First operand 4165 states and 5955 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:14,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:14,532 INFO L93 Difference]: Finished difference Result 7177 states and 10437 transitions. [2021-10-13 01:15:14,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:14,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-13 01:15:14,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:14,550 INFO L225 Difference]: With dead ends: 7177 [2021-10-13 01:15:14,550 INFO L226 Difference]: Without dead ends: 7175 [2021-10-13 01:15:14,552 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:14,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7175 states. [2021-10-13 01:15:14,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7175 to 6149. [2021-10-13 01:15:14,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 8515 transitions. [2021-10-13 01:15:14,726 INFO L78 Accepts]: Start accepts. Automaton has 6149 states and 8515 transitions. Word has length 25 [2021-10-13 01:15:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:14,726 INFO L470 AbstractCegarLoop]: Abstraction has 6149 states and 8515 transitions. [2021-10-13 01:15:14,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:14,727 INFO L276 IsEmpty]: Start isEmpty. Operand 6149 states and 8515 transitions. [2021-10-13 01:15:14,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 01:15:14,766 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:14,766 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:14,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 01:15:14,767 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:14,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:14,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1726250396, now seen corresponding path program 1 times [2021-10-13 01:15:14,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:14,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374064915] [2021-10-13 01:15:14,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:14,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:14,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:14,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:14,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374064915] [2021-10-13 01:15:14,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374064915] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:14,794 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:14,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:14,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518099114] [2021-10-13 01:15:14,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:14,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:14,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:14,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:14,796 INFO L87 Difference]: Start difference. First operand 6149 states and 8515 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:14,933 INFO L93 Difference]: Finished difference Result 14089 states and 19525 transitions. [2021-10-13 01:15:14,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:14,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-13 01:15:14,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:14,950 INFO L225 Difference]: With dead ends: 14089 [2021-10-13 01:15:14,950 INFO L226 Difference]: Without dead ends: 8071 [2021-10-13 01:15:14,958 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:14,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8071 states. [2021-10-13 01:15:15,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8071 to 8069. [2021-10-13 01:15:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:15,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8069 states to 8069 states and 11011 transitions. [2021-10-13 01:15:15,230 INFO L78 Accepts]: Start accepts. Automaton has 8069 states and 11011 transitions. Word has length 25 [2021-10-13 01:15:15,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:15,230 INFO L470 AbstractCegarLoop]: Abstraction has 8069 states and 11011 transitions. [2021-10-13 01:15:15,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:15,231 INFO L276 IsEmpty]: Start isEmpty. Operand 8069 states and 11011 transitions. [2021-10-13 01:15:15,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 01:15:15,240 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:15,240 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:15,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 01:15:15,241 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:15,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:15,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1040733483, now seen corresponding path program 1 times [2021-10-13 01:15:15,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:15,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583211073] [2021-10-13 01:15:15,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:15,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:15,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:15,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:15,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583211073] [2021-10-13 01:15:15,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583211073] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:15,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:15,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:15,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154462011] [2021-10-13 01:15:15,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:15,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:15,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:15,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:15,265 INFO L87 Difference]: Start difference. First operand 8069 states and 11011 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:15,376 INFO L93 Difference]: Finished difference Result 12105 states and 16453 transitions. [2021-10-13 01:15:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:15,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 01:15:15,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:15,394 INFO L225 Difference]: With dead ends: 12105 [2021-10-13 01:15:15,395 INFO L226 Difference]: Without dead ends: 8199 [2021-10-13 01:15:15,468 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:15,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8199 states. [2021-10-13 01:15:15,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 8197. [2021-10-13 01:15:15,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 11011 transitions. [2021-10-13 01:15:15,755 INFO L78 Accepts]: Start accepts. Automaton has 8197 states and 11011 transitions. Word has length 26 [2021-10-13 01:15:15,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:15,755 INFO L470 AbstractCegarLoop]: Abstraction has 8197 states and 11011 transitions. [2021-10-13 01:15:15,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 8197 states and 11011 transitions. [2021-10-13 01:15:15,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 01:15:15,765 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:15,766 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:15,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 01:15:15,766 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:15,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:15,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1974370135, now seen corresponding path program 1 times [2021-10-13 01:15:15,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:15,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084423735] [2021-10-13 01:15:15,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:15,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:15,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:15,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084423735] [2021-10-13 01:15:15,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084423735] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:15,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:15,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:15,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591793350] [2021-10-13 01:15:15,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:15,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:15,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:15,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:15,791 INFO L87 Difference]: Start difference. First operand 8197 states and 11011 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:16,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:16,028 INFO L93 Difference]: Finished difference Result 13833 states and 18821 transitions. [2021-10-13 01:15:16,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:16,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 01:15:16,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:16,060 INFO L225 Difference]: With dead ends: 13833 [2021-10-13 01:15:16,060 INFO L226 Difference]: Without dead ends: 13831 [2021-10-13 01:15:16,064 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13831 states. [2021-10-13 01:15:16,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13831 to 12293. [2021-10-13 01:15:16,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12293 states, 12292 states have (on average 1.3019036771884152) internal successors, (16003), 12292 states have internal predecessors, (16003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12293 states to 12293 states and 16003 transitions. [2021-10-13 01:15:16,554 INFO L78 Accepts]: Start accepts. Automaton has 12293 states and 16003 transitions. Word has length 26 [2021-10-13 01:15:16,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:16,554 INFO L470 AbstractCegarLoop]: Abstraction has 12293 states and 16003 transitions. [2021-10-13 01:15:16,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:16,554 INFO L276 IsEmpty]: Start isEmpty. Operand 12293 states and 16003 transitions. [2021-10-13 01:15:16,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 01:15:16,575 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:16,575 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:16,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 01:15:16,575 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:16,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:16,576 INFO L82 PathProgramCache]: Analyzing trace with hash 963252885, now seen corresponding path program 1 times [2021-10-13 01:15:16,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:16,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278495560] [2021-10-13 01:15:16,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:16,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:16,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:16,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:16,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278495560] [2021-10-13 01:15:16,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278495560] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:16,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:16,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:16,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485980026] [2021-10-13 01:15:16,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:16,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:16,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:16,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:16,604 INFO L87 Difference]: Start difference. First operand 12293 states and 16003 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:16,870 INFO L93 Difference]: Finished difference Result 27913 states and 36229 transitions. [2021-10-13 01:15:16,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:16,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 01:15:16,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:16,905 INFO L225 Difference]: With dead ends: 27913 [2021-10-13 01:15:16,906 INFO L226 Difference]: Without dead ends: 15879 [2021-10-13 01:15:16,922 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:16,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15879 states. [2021-10-13 01:15:17,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15879 to 15877. [2021-10-13 01:15:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15877 states, 15876 states have (on average 1.2740614764424287) internal successors, (20227), 15876 states have internal predecessors, (20227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15877 states to 15877 states and 20227 transitions. [2021-10-13 01:15:17,504 INFO L78 Accepts]: Start accepts. Automaton has 15877 states and 20227 transitions. Word has length 26 [2021-10-13 01:15:17,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:17,504 INFO L470 AbstractCegarLoop]: Abstraction has 15877 states and 20227 transitions. [2021-10-13 01:15:17,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:17,504 INFO L276 IsEmpty]: Start isEmpty. Operand 15877 states and 20227 transitions. [2021-10-13 01:15:17,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 01:15:17,523 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:17,523 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:17,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 01:15:17,524 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:17,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:17,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1076147793, now seen corresponding path program 1 times [2021-10-13 01:15:17,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:17,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016673422] [2021-10-13 01:15:17,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:17,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:17,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:17,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016673422] [2021-10-13 01:15:17,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016673422] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:17,559 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:17,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:17,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557809819] [2021-10-13 01:15:17,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:17,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:17,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:17,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:17,561 INFO L87 Difference]: Start difference. First operand 15877 states and 20227 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:17,911 INFO L93 Difference]: Finished difference Result 23817 states and 30213 transitions. [2021-10-13 01:15:17,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:17,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-13 01:15:17,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:17,947 INFO L225 Difference]: With dead ends: 23817 [2021-10-13 01:15:17,947 INFO L226 Difference]: Without dead ends: 16135 [2021-10-13 01:15:17,958 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:17,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16135 states. [2021-10-13 01:15:18,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16135 to 16133. [2021-10-13 01:15:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16133 states, 16132 states have (on average 1.2538432928341186) internal successors, (20227), 16132 states have internal predecessors, (20227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16133 states to 16133 states and 20227 transitions. [2021-10-13 01:15:18,504 INFO L78 Accepts]: Start accepts. Automaton has 16133 states and 20227 transitions. Word has length 27 [2021-10-13 01:15:18,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:18,504 INFO L470 AbstractCegarLoop]: Abstraction has 16133 states and 20227 transitions. [2021-10-13 01:15:18,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:18,504 INFO L276 IsEmpty]: Start isEmpty. Operand 16133 states and 20227 transitions. [2021-10-13 01:15:18,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 01:15:18,524 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:18,524 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:18,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-13 01:15:18,524 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:18,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:18,525 INFO L82 PathProgramCache]: Analyzing trace with hash -203715885, now seen corresponding path program 1 times [2021-10-13 01:15:18,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:18,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649335860] [2021-10-13 01:15:18,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:18,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:18,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:18,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:18,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649335860] [2021-10-13 01:15:18,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649335860] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:18,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:18,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:18,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145333086] [2021-10-13 01:15:18,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:18,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:18,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:18,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:18,547 INFO L87 Difference]: Start difference. First operand 16133 states and 20227 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:18,967 INFO L93 Difference]: Finished difference Result 26633 states and 33541 transitions. [2021-10-13 01:15:18,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:18,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-13 01:15:18,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:19,035 INFO L225 Difference]: With dead ends: 26633 [2021-10-13 01:15:19,035 INFO L226 Difference]: Without dead ends: 26631 [2021-10-13 01:15:19,044 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:19,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26631 states. [2021-10-13 01:15:19,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26631 to 24581. [2021-10-13 01:15:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24581 states, 24580 states have (on average 1.2186737184703011) internal successors, (29955), 24580 states have internal predecessors, (29955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24581 states to 24581 states and 29955 transitions. [2021-10-13 01:15:19,664 INFO L78 Accepts]: Start accepts. Automaton has 24581 states and 29955 transitions. Word has length 27 [2021-10-13 01:15:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:19,664 INFO L470 AbstractCegarLoop]: Abstraction has 24581 states and 29955 transitions. [2021-10-13 01:15:19,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:19,665 INFO L276 IsEmpty]: Start isEmpty. Operand 24581 states and 29955 transitions. [2021-10-13 01:15:19,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 01:15:19,709 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:19,709 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:19,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-13 01:15:19,709 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:19,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:19,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1214833135, now seen corresponding path program 1 times [2021-10-13 01:15:19,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:19,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077980937] [2021-10-13 01:15:19,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:19,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:19,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:19,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077980937] [2021-10-13 01:15:19,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077980937] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:19,734 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:19,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:19,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990982677] [2021-10-13 01:15:19,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:19,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:19,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:19,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:19,736 INFO L87 Difference]: Start difference. First operand 24581 states and 29955 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:20,449 INFO L93 Difference]: Finished difference Result 55305 states and 66821 transitions. [2021-10-13 01:15:20,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:20,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-13 01:15:20,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:20,517 INFO L225 Difference]: With dead ends: 55305 [2021-10-13 01:15:20,517 INFO L226 Difference]: Without dead ends: 31239 [2021-10-13 01:15:20,548 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:20,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31239 states. [2021-10-13 01:15:21,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31239 to 31237. [2021-10-13 01:15:21,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31237 states, 31236 states have (on average 1.1802727621974645) internal successors, (36867), 31236 states have internal predecessors, (36867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31237 states to 31237 states and 36867 transitions. [2021-10-13 01:15:21,619 INFO L78 Accepts]: Start accepts. Automaton has 31237 states and 36867 transitions. Word has length 27 [2021-10-13 01:15:21,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:21,620 INFO L470 AbstractCegarLoop]: Abstraction has 31237 states and 36867 transitions. [2021-10-13 01:15:21,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 31237 states and 36867 transitions. [2021-10-13 01:15:21,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 01:15:21,649 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:21,649 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:21,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-13 01:15:21,650 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:21,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:21,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2020009046, now seen corresponding path program 1 times [2021-10-13 01:15:21,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:21,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337778000] [2021-10-13 01:15:21,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:21,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:21,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:21,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337778000] [2021-10-13 01:15:21,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337778000] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:21,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:21,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:21,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870035353] [2021-10-13 01:15:21,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:21,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:21,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:21,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:21,677 INFO L87 Difference]: Start difference. First operand 31237 states and 36867 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:22,219 INFO L93 Difference]: Finished difference Result 46857 states and 55045 transitions. [2021-10-13 01:15:22,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:22,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-13 01:15:22,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:22,268 INFO L225 Difference]: With dead ends: 46857 [2021-10-13 01:15:22,268 INFO L226 Difference]: Without dead ends: 31751 [2021-10-13 01:15:22,282 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:22,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31751 states. [2021-10-13 01:15:23,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31751 to 31749. [2021-10-13 01:15:23,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31749 states, 31748 states have (on average 1.1612385032128008) internal successors, (36867), 31748 states have internal predecessors, (36867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31749 states to 31749 states and 36867 transitions. [2021-10-13 01:15:23,096 INFO L78 Accepts]: Start accepts. Automaton has 31749 states and 36867 transitions. Word has length 28 [2021-10-13 01:15:23,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:23,096 INFO L470 AbstractCegarLoop]: Abstraction has 31749 states and 36867 transitions. [2021-10-13 01:15:23,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 31749 states and 36867 transitions. [2021-10-13 01:15:23,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 01:15:23,122 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:23,122 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:23,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-13 01:15:23,123 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:23,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:23,124 INFO L82 PathProgramCache]: Analyzing trace with hash 995094572, now seen corresponding path program 1 times [2021-10-13 01:15:23,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:23,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806631847] [2021-10-13 01:15:23,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:23,125 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:23,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:23,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806631847] [2021-10-13 01:15:23,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806631847] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:23,149 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:23,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:23,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422782272] [2021-10-13 01:15:23,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:23,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:23,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:23,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:23,151 INFO L87 Difference]: Start difference. First operand 31749 states and 36867 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:23,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:23,887 INFO L93 Difference]: Finished difference Result 92167 states and 104452 transitions. [2021-10-13 01:15:23,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:23,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-13 01:15:23,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:23,947 INFO L225 Difference]: With dead ends: 92167 [2021-10-13 01:15:23,947 INFO L226 Difference]: Without dead ends: 31749 [2021-10-13 01:15:23,982 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:24,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31749 states. [2021-10-13 01:15:24,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31749 to 31749. [2021-10-13 01:15:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31749 states, 31748 states have (on average 1.096730502708832) internal successors, (34819), 31748 states have internal predecessors, (34819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31749 states to 31749 states and 34819 transitions. [2021-10-13 01:15:24,773 INFO L78 Accepts]: Start accepts. Automaton has 31749 states and 34819 transitions. Word has length 28 [2021-10-13 01:15:24,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:24,773 INFO L470 AbstractCegarLoop]: Abstraction has 31749 states and 34819 transitions. [2021-10-13 01:15:24,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 31749 states and 34819 transitions. [2021-10-13 01:15:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 01:15:24,802 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:15:24,803 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:15:24,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-13 01:15:24,803 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:15:24,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:15:24,804 INFO L82 PathProgramCache]: Analyzing trace with hash 2006211822, now seen corresponding path program 1 times [2021-10-13 01:15:24,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:15:24,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951265536] [2021-10-13 01:15:24,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:15:24,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:15:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:15:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:15:24,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:15:24,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951265536] [2021-10-13 01:15:24,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951265536] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:15:24,835 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:15:24,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:15:24,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846400823] [2021-10-13 01:15:24,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:15:24,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:15:24,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:15:24,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:24,837 INFO L87 Difference]: Start difference. First operand 31749 states and 34819 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:25,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:15:25,081 INFO L93 Difference]: Finished difference Result 31749 states and 34819 transitions. [2021-10-13 01:15:25,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:15:25,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-13 01:15:25,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:15:25,083 INFO L225 Difference]: With dead ends: 31749 [2021-10-13 01:15:25,083 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 01:15:25,096 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:15:25,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 01:15:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 01:15:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 01:15:25,098 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2021-10-13 01:15:25,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:15:25,098 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 01:15:25,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:15:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 01:15:25,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 01:15:25,102 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:15:25,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-13 01:15:25,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-13 01:15:25,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:15:25,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:15:25,117 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:15:25,117 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:15:25,126 INFO L857 garLoopResultBuilder]: For program point L159-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,126 INFO L857 garLoopResultBuilder]: For program point L93-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,126 INFO L857 garLoopResultBuilder]: For program point L85-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,127 INFO L857 garLoopResultBuilder]: For program point L77-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,127 INFO L857 garLoopResultBuilder]: For program point L135(line 135) no Hoare annotation was computed. [2021-10-13 01:15:25,127 INFO L857 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2021-10-13 01:15:25,127 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-13 01:15:25,127 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-13 01:15:25,127 INFO L857 garLoopResultBuilder]: For program point L119-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,128 INFO L857 garLoopResultBuilder]: For program point L144-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,128 INFO L860 garLoopResultBuilder]: At program point L169-1(lines 44 174) the Hoare annotation is: true [2021-10-13 01:15:25,128 INFO L857 garLoopResultBuilder]: For program point L120(line 120) no Hoare annotation was computed. [2021-10-13 01:15:25,128 INFO L860 garLoopResultBuilder]: At program point L178(lines 6 179) the Hoare annotation is: true [2021-10-13 01:15:25,128 INFO L857 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2021-10-13 01:15:25,129 INFO L857 garLoopResultBuilder]: For program point L46(lines 46 48) no Hoare annotation was computed. [2021-10-13 01:15:25,129 INFO L857 garLoopResultBuilder]: For program point L170(line 170) no Hoare annotation was computed. [2021-10-13 01:15:25,129 INFO L853 garLoopResultBuilder]: At program point L170-1(lines 7 179) the Hoare annotation is: false [2021-10-13 01:15:25,129 INFO L857 garLoopResultBuilder]: For program point L129-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,129 INFO L857 garLoopResultBuilder]: For program point L154-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,130 INFO L857 garLoopResultBuilder]: For program point L113-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,130 INFO L857 garLoopResultBuilder]: For program point L105-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,130 INFO L857 garLoopResultBuilder]: For program point L130(line 130) no Hoare annotation was computed. [2021-10-13 01:15:25,130 INFO L857 garLoopResultBuilder]: For program point L97-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,130 INFO L857 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2021-10-13 01:15:25,130 INFO L857 garLoopResultBuilder]: For program point L89-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,131 INFO L857 garLoopResultBuilder]: For program point L81-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,131 INFO L857 garLoopResultBuilder]: For program point L139-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,131 INFO L857 garLoopResultBuilder]: For program point L73(lines 73 75) no Hoare annotation was computed. [2021-10-13 01:15:25,131 INFO L857 garLoopResultBuilder]: For program point L73-2(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,131 INFO L857 garLoopResultBuilder]: For program point L164-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,131 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-13 01:15:25,132 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2021-10-13 01:15:25,132 INFO L857 garLoopResultBuilder]: For program point L140(line 140) no Hoare annotation was computed. [2021-10-13 01:15:25,132 INFO L857 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2021-10-13 01:15:25,132 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-13 01:15:25,132 INFO L857 garLoopResultBuilder]: For program point L124-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,132 INFO L857 garLoopResultBuilder]: For program point L149-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,133 INFO L857 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2021-10-13 01:15:25,133 INFO L857 garLoopResultBuilder]: For program point L150(line 150) no Hoare annotation was computed. [2021-10-13 01:15:25,133 INFO L860 garLoopResultBuilder]: At program point L175(lines 7 179) the Hoare annotation is: true [2021-10-13 01:15:25,133 INFO L857 garLoopResultBuilder]: For program point L109-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,133 INFO L857 garLoopResultBuilder]: For program point L134-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,133 INFO L857 garLoopResultBuilder]: For program point L101-1(lines 44 174) no Hoare annotation was computed. [2021-10-13 01:15:25,138 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 01:15:25,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:15:25 BoogieIcfgContainer [2021-10-13 01:15:25,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 01:15:25,146 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 01:15:25,146 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 01:15:25,147 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 01:15:25,147 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:15:10" (3/4) ... [2021-10-13 01:15:25,150 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 01:15:25,162 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-13 01:15:25,163 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-13 01:15:25,163 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 01:15:25,163 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 01:15:25,209 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 01:15:25,209 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 01:15:25,211 INFO L168 Benchmark]: Toolchain (without parser) took 15888.88 ms. Allocated memory was 90.2 MB in the beginning and 8.0 GB in the end (delta: 7.9 GB). Free memory was 55.8 MB in the beginning and 7.1 GB in the end (delta: -7.1 GB). Peak memory consumption was 798.9 MB. Max. memory is 16.1 GB. [2021-10-13 01:15:25,211 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 90.2 MB. Free memory was 62.6 MB in the beginning and 62.6 MB in the end (delta: 24.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:15:25,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.08 ms. Allocated memory is still 90.2 MB. Free memory was 55.6 MB in the beginning and 65.6 MB in the end (delta: -10.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 01:15:25,212 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.26 ms. Allocated memory is still 90.2 MB. Free memory was 65.6 MB in the beginning and 63.9 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:15:25,212 INFO L168 Benchmark]: Boogie Preprocessor took 34.07 ms. Allocated memory is still 90.2 MB. Free memory was 63.9 MB in the beginning and 62.7 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:15:25,213 INFO L168 Benchmark]: RCFGBuilder took 581.53 ms. Allocated memory is still 90.2 MB. Free memory was 62.7 MB in the beginning and 50.3 MB in the end (delta: 12.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-13 01:15:25,213 INFO L168 Benchmark]: TraceAbstraction took 14843.57 ms. Allocated memory was 90.2 MB in the beginning and 8.0 GB in the end (delta: 7.9 GB). Free memory was 49.6 MB in the beginning and 7.1 GB in the end (delta: -7.1 GB). Peak memory consumption was 791.2 MB. Max. memory is 16.1 GB. [2021-10-13 01:15:25,214 INFO L168 Benchmark]: Witness Printer took 62.87 ms. Allocated memory is still 8.0 GB. Free memory was 7.1 GB in the beginning and 7.1 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 01:15:25,216 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.27 ms. Allocated memory is still 90.2 MB. Free memory was 62.6 MB in the beginning and 62.6 MB in the end (delta: 24.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 287.08 ms. Allocated memory is still 90.2 MB. Free memory was 55.6 MB in the beginning and 65.6 MB in the end (delta: -10.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 55.26 ms. Allocated memory is still 90.2 MB. Free memory was 65.6 MB in the beginning and 63.9 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.07 ms. Allocated memory is still 90.2 MB. Free memory was 63.9 MB in the beginning and 62.7 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 581.53 ms. Allocated memory is still 90.2 MB. Free memory was 62.7 MB in the beginning and 50.3 MB in the end (delta: 12.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14843.57 ms. Allocated memory was 90.2 MB in the beginning and 8.0 GB in the end (delta: 7.9 GB). Free memory was 49.6 MB in the beginning and 7.1 GB in the end (delta: -7.1 GB). Peak memory consumption was 791.2 MB. Max. memory is 16.1 GB. * Witness Printer took 62.87 ms. Allocated memory is still 8.0 GB. Free memory was 7.1 GB in the beginning and 7.1 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14775.7ms, OverallIterations: 31, TraceHistogramMax: 1, EmptinessCheckTime: 305.6ms, AutomataDifference: 5771.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 22.8ms, InitialAbstractionConstructionTime: 12.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2753 SDtfs, 1400 SDslu, 1835 SDs, 0 SdLazy, 163 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 269.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 113.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=31749occurred in iteration=29, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 6677.5ms AutomataMinimizationTime, 31 MinimizatonAttempts, 6176 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 2057 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 6.6ms HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 4.6ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 99.8ms SsaConstructionTime, 394.1ms SatisfiabilityAnalysisTime, 1023.7ms InterpolantComputationTime, 720 NumberOfCodeBlocks, 720 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 689 ConstructedInterpolants, 0 QuantifiedInterpolants, 1492 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-10-13 01:15:25,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b1a696-dd73-4c5a-8040-e09a37618990/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...