./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410b830d-24c0-4a86-abb5-a01e8af19789/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410b830d-24c0-4a86-abb5-a01e8af19789/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410b830d-24c0-4a86-abb5-a01e8af19789/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410b830d-24c0-4a86-abb5-a01e8af19789/bin/uautomizer-UnR33cPsHg/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_8.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410b830d-24c0-4a86-abb5-a01e8af19789/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410b830d-24c0-4a86-abb5-a01e8af19789/bin/uautomizer-UnR33cPsHg --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 b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 09:11:41,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:11:41,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:11:41,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:11:41,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:11:41,663 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:11:41,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:11:41,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:11:41,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:11:41,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:11:41,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:11:41,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:11:41,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:11:41,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:11:41,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:11:41,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:11:41,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:11:41,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:11:41,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:11:41,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:11:41,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:11:41,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:11:41,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:11:41,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:11:41,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:11:41,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:11:41,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:11:41,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:11:41,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:11:41,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:11:41,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:11:41,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:11:41,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:11:41,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:11:41,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:11:41,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:11:41,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:11:41,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:11:41,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:11:41,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:11:41,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:11:41,751 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410b830d-24c0-4a86-abb5-a01e8af19789/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 09:11:41,800 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:11:41,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:11:41,801 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:11:41,802 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:11:41,804 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:11:41,804 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:11:41,804 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:11:41,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:11:41,805 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 09:11:41,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:11:41,807 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 09:11:41,807 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:11:41,807 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 09:11:41,808 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 09:11:41,808 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 09:11:41,808 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 09:11:41,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 09:11:41,809 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:11:41,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 09:11:41,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:11:41,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:11:41,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 09:11:41,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:11:41,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:11:41,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 09:11:41,812 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 09:11:41,812 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:11:41,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 09:11:41,812 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 09:11:41,814 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 09:11:41,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 09:11:41,815 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:11:41,815 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_410b830d-24c0-4a86-abb5-a01e8af19789/bin/uautomizer-UnR33cPsHg/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_410b830d-24c0-4a86-abb5-a01e8af19789/bin/uautomizer-UnR33cPsHg 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 -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2021-10-28 09:11:42,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:11:42,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:11:42,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:11:42,162 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:11:42,162 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:11:42,164 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410b830d-24c0-4a86-abb5-a01e8af19789/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/locks/test_locks_8.c [2021-10-28 09:11:42,283 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410b830d-24c0-4a86-abb5-a01e8af19789/bin/uautomizer-UnR33cPsHg/data/94197344c/f49c82796b3c4acb8a00455325ed6eea/FLAG4c59692d2 [2021-10-28 09:11:42,913 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:11:42,918 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410b830d-24c0-4a86-abb5-a01e8af19789/sv-benchmarks/c/locks/test_locks_8.c [2021-10-28 09:11:42,934 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410b830d-24c0-4a86-abb5-a01e8af19789/bin/uautomizer-UnR33cPsHg/data/94197344c/f49c82796b3c4acb8a00455325ed6eea/FLAG4c59692d2 [2021-10-28 09:11:43,246 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410b830d-24c0-4a86-abb5-a01e8af19789/bin/uautomizer-UnR33cPsHg/data/94197344c/f49c82796b3c4acb8a00455325ed6eea [2021-10-28 09:11:43,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:11:43,256 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 09:11:43,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:11:43,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:11:43,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:11:43,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:11:43" (1/1) ... [2021-10-28 09:11:43,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1da98e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:43, skipping insertion in model container [2021-10-28 09:11:43,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:11:43" (1/1) ... [2021-10-28 09:11:43,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:11:43,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:11:43,531 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_410b830d-24c0-4a86-abb5-a01e8af19789/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2021-10-28 09:11:43,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:11:43,546 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:11:43,604 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_410b830d-24c0-4a86-abb5-a01e8af19789/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2021-10-28 09:11:43,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:11:43,625 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:11:43,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:43 WrapperNode [2021-10-28 09:11:43,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:11:43,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 09:11:43,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 09:11:43,629 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 09:11:43,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:43" (1/1) ... [2021-10-28 09:11:43,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:43" (1/1) ... [2021-10-28 09:11:43,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 09:11:43,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:11:43,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:11:43,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:11:43,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:43" (1/1) ... [2021-10-28 09:11:43,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:43" (1/1) ... [2021-10-28 09:11:43,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:43" (1/1) ... [2021-10-28 09:11:43,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:43" (1/1) ... [2021-10-28 09:11:43,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:43" (1/1) ... [2021-10-28 09:11:43,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:43" (1/1) ... [2021-10-28 09:11:43,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:43" (1/1) ... [2021-10-28 09:11:43,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:11:43,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:11:43,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:11:43,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:11:43,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:43" (1/1) ... [2021-10-28 09:11:43,749 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:11:43,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410b830d-24c0-4a86-abb5-a01e8af19789/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:11:43,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410b830d-24c0-4a86-abb5-a01e8af19789/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 09:11:43,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410b830d-24c0-4a86-abb5-a01e8af19789/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 09:11:43,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:11:43,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:11:43,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:11:43,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:11:44,129 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:11:44,130 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-28 09:11:44,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:11:44 BoogieIcfgContainer [2021-10-28 09:11:44,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:11:44,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 09:11:44,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 09:11:44,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 09:11:44,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 09:11:43" (1/3) ... [2021-10-28 09:11:44,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4526d540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:11:44, skipping insertion in model container [2021-10-28 09:11:44,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:43" (2/3) ... [2021-10-28 09:11:44,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4526d540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:11:44, skipping insertion in model container [2021-10-28 09:11:44,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:11:44" (3/3) ... [2021-10-28 09:11:44,142 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2021-10-28 09:11:44,148 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 09:11:44,148 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-28 09:11:44,221 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 09:11:44,229 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 09:11:44,235 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-28 09:11:44,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 32 states have (on average 1.875) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-28 09:11:44,287 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:44,288 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:44,288 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:44,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:44,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1577492323, now seen corresponding path program 1 times [2021-10-28 09:11:44,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:44,307 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105788737] [2021-10-28 09:11:44,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:44,308 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:44,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:44,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105788737] [2021-10-28 09:11:44,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105788737] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:44,523 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:44,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:44,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206802166] [2021-10-28 09:11:44,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:44,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:44,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:44,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:44,552 INFO L87 Difference]: Start difference. First operand has 34 states, 32 states have (on average 1.875) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:44,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:44,613 INFO L93 Difference]: Finished difference Result 71 states and 121 transitions. [2021-10-28 09:11:44,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:44,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-10-28 09:11:44,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:44,630 INFO L225 Difference]: With dead ends: 71 [2021-10-28 09:11:44,631 INFO L226 Difference]: Without dead ends: 57 [2021-10-28 09:11:44,636 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-10-28 09:11:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2021-10-28 09:11:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 70 transitions. [2021-10-28 09:11:44,693 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 70 transitions. Word has length 15 [2021-10-28 09:11:44,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:44,695 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 70 transitions. [2021-10-28 09:11:44,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:44,696 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 70 transitions. [2021-10-28 09:11:44,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-28 09:11:44,697 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:44,698 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:44,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 09:11:44,699 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:44,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:44,705 INFO L85 PathProgramCache]: Analyzing trace with hash -876427745, now seen corresponding path program 1 times [2021-10-28 09:11:44,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:44,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083416585] [2021-10-28 09:11:44,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:44,706 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:44,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:44,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:44,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083416585] [2021-10-28 09:11:44,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083416585] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:44,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:44,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:44,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721895540] [2021-10-28 09:11:44,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:44,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:44,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:44,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:44,853 INFO L87 Difference]: Start difference. First operand 39 states and 70 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:44,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:44,899 INFO L93 Difference]: Finished difference Result 94 states and 169 transitions. [2021-10-28 09:11:44,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:44,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-10-28 09:11:44,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:44,905 INFO L225 Difference]: With dead ends: 94 [2021-10-28 09:11:44,906 INFO L226 Difference]: Without dead ends: 57 [2021-10-28 09:11:44,907 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:44,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-10-28 09:11:44,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2021-10-28 09:11:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2021-10-28 09:11:44,931 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 15 [2021-10-28 09:11:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:44,932 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2021-10-28 09:11:44,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2021-10-28 09:11:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-28 09:11:44,935 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:44,935 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:44,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 09:11:44,937 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:44,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:44,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1657407761, now seen corresponding path program 1 times [2021-10-28 09:11:44,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:44,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716961254] [2021-10-28 09:11:44,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:44,944 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:45,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:45,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716961254] [2021-10-28 09:11:45,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716961254] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:45,009 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:45,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:45,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251636013] [2021-10-28 09:11:45,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:45,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:45,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:45,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:45,012 INFO L87 Difference]: Start difference. First operand 55 states and 98 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:45,027 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2021-10-28 09:11:45,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:45,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-28 09:11:45,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:45,030 INFO L225 Difference]: With dead ends: 87 [2021-10-28 09:11:45,030 INFO L226 Difference]: Without dead ends: 60 [2021-10-28 09:11:45,031 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:45,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-10-28 09:11:45,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2021-10-28 09:11:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 57 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2021-10-28 09:11:45,043 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 16 [2021-10-28 09:11:45,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:45,044 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2021-10-28 09:11:45,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2021-10-28 09:11:45,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-28 09:11:45,045 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:45,045 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:45,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 09:11:45,046 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:45,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:45,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1399242323, now seen corresponding path program 1 times [2021-10-28 09:11:45,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:45,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939660154] [2021-10-28 09:11:45,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:45,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:45,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-28 09:11:45,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:45,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939660154] [2021-10-28 09:11:45,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939660154] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:45,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:45,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:45,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984747134] [2021-10-28 09:11:45,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:45,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:45,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:45,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:45,152 INFO L87 Difference]: Start difference. First operand 58 states and 100 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:45,174 INFO L93 Difference]: Finished difference Result 109 states and 189 transitions. [2021-10-28 09:11:45,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:45,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-28 09:11:45,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:45,176 INFO L225 Difference]: With dead ends: 109 [2021-10-28 09:11:45,176 INFO L226 Difference]: Without dead ends: 107 [2021-10-28 09:11:45,177 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:45,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-10-28 09:11:45,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2021-10-28 09:11:45,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.75) internal successors, (133), 76 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 133 transitions. [2021-10-28 09:11:45,185 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 133 transitions. Word has length 16 [2021-10-28 09:11:45,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:45,186 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 133 transitions. [2021-10-28 09:11:45,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,186 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 133 transitions. [2021-10-28 09:11:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-28 09:11:45,187 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:45,188 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:45,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 09:11:45,188 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:45,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:45,189 INFO L85 PathProgramCache]: Analyzing trace with hash -698177745, now seen corresponding path program 1 times [2021-10-28 09:11:45,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:45,190 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608421570] [2021-10-28 09:11:45,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:45,190 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:45,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:45,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608421570] [2021-10-28 09:11:45,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608421570] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:45,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:45,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:45,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931130161] [2021-10-28 09:11:45,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:45,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:45,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:45,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:45,234 INFO L87 Difference]: Start difference. First operand 77 states and 133 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:45,251 INFO L93 Difference]: Finished difference Result 181 states and 315 transitions. [2021-10-28 09:11:45,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:45,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-28 09:11:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:45,253 INFO L225 Difference]: With dead ends: 181 [2021-10-28 09:11:45,253 INFO L226 Difference]: Without dead ends: 109 [2021-10-28 09:11:45,254 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:45,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-10-28 09:11:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2021-10-28 09:11:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 106 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 183 transitions. [2021-10-28 09:11:45,265 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 183 transitions. Word has length 16 [2021-10-28 09:11:45,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:45,265 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 183 transitions. [2021-10-28 09:11:45,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,266 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 183 transitions. [2021-10-28 09:11:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-28 09:11:45,267 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:45,267 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:45,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 09:11:45,268 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:45,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash -426624716, now seen corresponding path program 1 times [2021-10-28 09:11:45,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:45,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326750461] [2021-10-28 09:11:45,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:45,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:45,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:45,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326750461] [2021-10-28 09:11:45,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326750461] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:45,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:45,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:45,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275014800] [2021-10-28 09:11:45,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:45,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:45,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:45,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:45,329 INFO L87 Difference]: Start difference. First operand 107 states and 183 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:45,356 INFO L93 Difference]: Finished difference Result 162 states and 274 transitions. [2021-10-28 09:11:45,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:45,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-28 09:11:45,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:45,358 INFO L225 Difference]: With dead ends: 162 [2021-10-28 09:11:45,358 INFO L226 Difference]: Without dead ends: 111 [2021-10-28 09:11:45,359 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-10-28 09:11:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2021-10-28 09:11:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 108 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 183 transitions. [2021-10-28 09:11:45,373 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 183 transitions. Word has length 17 [2021-10-28 09:11:45,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:45,373 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 183 transitions. [2021-10-28 09:11:45,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 183 transitions. [2021-10-28 09:11:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-28 09:11:45,375 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:45,375 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:45,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 09:11:45,376 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:45,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:45,377 INFO L85 PathProgramCache]: Analyzing trace with hash -168459278, now seen corresponding path program 1 times [2021-10-28 09:11:45,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:45,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598211549] [2021-10-28 09:11:45,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:45,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:45,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:45,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598211549] [2021-10-28 09:11:45,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598211549] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:45,441 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:45,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:45,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398968978] [2021-10-28 09:11:45,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:45,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:45,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:45,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:45,444 INFO L87 Difference]: Start difference. First operand 109 states and 183 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:45,491 INFO L93 Difference]: Finished difference Result 309 states and 521 transitions. [2021-10-28 09:11:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:45,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-28 09:11:45,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:45,494 INFO L225 Difference]: With dead ends: 309 [2021-10-28 09:11:45,494 INFO L226 Difference]: Without dead ends: 207 [2021-10-28 09:11:45,495 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:45,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-10-28 09:11:45,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2021-10-28 09:11:45,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.661764705882353) internal successors, (339), 204 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 339 transitions. [2021-10-28 09:11:45,530 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 339 transitions. Word has length 17 [2021-10-28 09:11:45,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:45,531 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 339 transitions. [2021-10-28 09:11:45,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,531 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 339 transitions. [2021-10-28 09:11:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-28 09:11:45,533 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:45,533 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:45,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 09:11:45,533 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:45,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:45,534 INFO L85 PathProgramCache]: Analyzing trace with hash -869523856, now seen corresponding path program 1 times [2021-10-28 09:11:45,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:45,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077899589] [2021-10-28 09:11:45,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:45,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:45,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:45,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077899589] [2021-10-28 09:11:45,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077899589] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:45,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:45,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:45,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505916695] [2021-10-28 09:11:45,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:45,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:45,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:45,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:45,645 INFO L87 Difference]: Start difference. First operand 205 states and 339 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:45,686 INFO L93 Difference]: Finished difference Result 257 states and 429 transitions. [2021-10-28 09:11:45,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:45,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-28 09:11:45,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:45,691 INFO L225 Difference]: With dead ends: 257 [2021-10-28 09:11:45,691 INFO L226 Difference]: Without dead ends: 255 [2021-10-28 09:11:45,692 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:45,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-10-28 09:11:45,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 205. [2021-10-28 09:11:45,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.642156862745098) internal successors, (335), 204 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 335 transitions. [2021-10-28 09:11:45,717 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 335 transitions. Word has length 17 [2021-10-28 09:11:45,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:45,717 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 335 transitions. [2021-10-28 09:11:45,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,718 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 335 transitions. [2021-10-28 09:11:45,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-28 09:11:45,719 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:45,720 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:45,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 09:11:45,720 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:45,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:45,721 INFO L85 PathProgramCache]: Analyzing trace with hash -927055644, now seen corresponding path program 1 times [2021-10-28 09:11:45,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:45,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756101597] [2021-10-28 09:11:45,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:45,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:45,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:45,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756101597] [2021-10-28 09:11:45,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756101597] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:45,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:45,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:45,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716474819] [2021-10-28 09:11:45,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:45,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:45,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:45,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:45,795 INFO L87 Difference]: Start difference. First operand 205 states and 335 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:45,829 INFO L93 Difference]: Finished difference Result 373 states and 617 transitions. [2021-10-28 09:11:45,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:45,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-28 09:11:45,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:45,836 INFO L225 Difference]: With dead ends: 373 [2021-10-28 09:11:45,836 INFO L226 Difference]: Without dead ends: 371 [2021-10-28 09:11:45,837 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-10-28 09:11:45,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 289. [2021-10-28 09:11:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.6076388888888888) internal successors, (463), 288 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 463 transitions. [2021-10-28 09:11:45,864 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 463 transitions. Word has length 18 [2021-10-28 09:11:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:45,864 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 463 transitions. [2021-10-28 09:11:45,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 463 transitions. [2021-10-28 09:11:45,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-28 09:11:45,873 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:45,873 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:45,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 09:11:45,874 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:45,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:45,874 INFO L85 PathProgramCache]: Analyzing trace with hash -225991066, now seen corresponding path program 1 times [2021-10-28 09:11:45,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:45,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189948742] [2021-10-28 09:11:45,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:45,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:45,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:45,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:45,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189948742] [2021-10-28 09:11:45,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189948742] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:45,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:45,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:45,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501610631] [2021-10-28 09:11:45,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:45,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:45,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:45,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:45,931 INFO L87 Difference]: Start difference. First operand 289 states and 463 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:45,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:45,977 INFO L93 Difference]: Finished difference Result 677 states and 1089 transitions. [2021-10-28 09:11:45,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:45,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-28 09:11:45,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:45,983 INFO L225 Difference]: With dead ends: 677 [2021-10-28 09:11:45,983 INFO L226 Difference]: Without dead ends: 395 [2021-10-28 09:11:45,988 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:45,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-10-28 09:11:46,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2021-10-28 09:11:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.5790816326530612) internal successors, (619), 392 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 619 transitions. [2021-10-28 09:11:46,018 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 619 transitions. Word has length 18 [2021-10-28 09:11:46,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:46,018 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 619 transitions. [2021-10-28 09:11:46,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,019 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 619 transitions. [2021-10-28 09:11:46,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 09:11:46,021 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:46,021 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:46,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 09:11:46,022 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:46,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:46,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1326261127, now seen corresponding path program 1 times [2021-10-28 09:11:46,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:46,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299688029] [2021-10-28 09:11:46,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:46,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:46,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:46,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299688029] [2021-10-28 09:11:46,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299688029] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:46,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:46,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:46,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655842002] [2021-10-28 09:11:46,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:46,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:46,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:46,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:46,069 INFO L87 Difference]: Start difference. First operand 393 states and 619 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:46,109 INFO L93 Difference]: Finished difference Result 597 states and 937 transitions. [2021-10-28 09:11:46,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:46,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-28 09:11:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:46,113 INFO L225 Difference]: With dead ends: 597 [2021-10-28 09:11:46,113 INFO L226 Difference]: Without dead ends: 407 [2021-10-28 09:11:46,114 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:46,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-10-28 09:11:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2021-10-28 09:11:46,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.551980198019802) internal successors, (627), 404 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 627 transitions. [2021-10-28 09:11:46,131 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 627 transitions. Word has length 19 [2021-10-28 09:11:46,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:46,131 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 627 transitions. [2021-10-28 09:11:46,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,132 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 627 transitions. [2021-10-28 09:11:46,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 09:11:46,133 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:46,134 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:46,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 09:11:46,134 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:46,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:46,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1584426565, now seen corresponding path program 1 times [2021-10-28 09:11:46,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:46,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905682097] [2021-10-28 09:11:46,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:46,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:46,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:46,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905682097] [2021-10-28 09:11:46,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905682097] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:46,183 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:46,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:46,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525199814] [2021-10-28 09:11:46,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:46,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:46,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:46,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:46,188 INFO L87 Difference]: Start difference. First operand 405 states and 627 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:46,216 INFO L93 Difference]: Finished difference Result 713 states and 1117 transitions. [2021-10-28 09:11:46,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:46,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-28 09:11:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:46,222 INFO L225 Difference]: With dead ends: 713 [2021-10-28 09:11:46,222 INFO L226 Difference]: Without dead ends: 711 [2021-10-28 09:11:46,223 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:46,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2021-10-28 09:11:46,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 581. [2021-10-28 09:11:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.5086206896551724) internal successors, (875), 580 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 875 transitions. [2021-10-28 09:11:46,247 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 875 transitions. Word has length 19 [2021-10-28 09:11:46,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:46,247 INFO L470 AbstractCegarLoop]: Abstraction has 581 states and 875 transitions. [2021-10-28 09:11:46,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 875 transitions. [2021-10-28 09:11:46,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 09:11:46,256 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:46,256 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:46,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 09:11:46,257 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:46,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:46,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2009476153, now seen corresponding path program 1 times [2021-10-28 09:11:46,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:46,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771788381] [2021-10-28 09:11:46,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:46,258 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:46,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:46,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771788381] [2021-10-28 09:11:46,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771788381] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:46,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:46,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:46,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959039272] [2021-10-28 09:11:46,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:46,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:46,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:46,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:46,303 INFO L87 Difference]: Start difference. First operand 581 states and 875 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:46,333 INFO L93 Difference]: Finished difference Result 1337 states and 2013 transitions. [2021-10-28 09:11:46,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:46,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-28 09:11:46,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:46,340 INFO L225 Difference]: With dead ends: 1337 [2021-10-28 09:11:46,340 INFO L226 Difference]: Without dead ends: 775 [2021-10-28 09:11:46,341 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:46,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2021-10-28 09:11:46,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 773. [2021-10-28 09:11:46,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4753886010362693) internal successors, (1139), 772 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1139 transitions. [2021-10-28 09:11:46,373 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1139 transitions. Word has length 19 [2021-10-28 09:11:46,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:46,374 INFO L470 AbstractCegarLoop]: Abstraction has 773 states and 1139 transitions. [2021-10-28 09:11:46,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,374 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1139 transitions. [2021-10-28 09:11:46,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-28 09:11:46,377 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:46,377 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:46,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 09:11:46,378 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:46,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:46,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1872798619, now seen corresponding path program 1 times [2021-10-28 09:11:46,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:46,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401020376] [2021-10-28 09:11:46,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:46,379 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:46,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:46,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401020376] [2021-10-28 09:11:46,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401020376] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:46,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:46,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:46,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478557672] [2021-10-28 09:11:46,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:46,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:46,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:46,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:46,436 INFO L87 Difference]: Start difference. First operand 773 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:46,468 INFO L93 Difference]: Finished difference Result 1161 states and 1701 transitions. [2021-10-28 09:11:46,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:46,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-28 09:11:46,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:46,474 INFO L225 Difference]: With dead ends: 1161 [2021-10-28 09:11:46,475 INFO L226 Difference]: Without dead ends: 791 [2021-10-28 09:11:46,476 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:46,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2021-10-28 09:11:46,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 789. [2021-10-28 09:11:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.4454314720812182) internal successors, (1139), 788 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1139 transitions. [2021-10-28 09:11:46,507 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1139 transitions. Word has length 20 [2021-10-28 09:11:46,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:46,507 INFO L470 AbstractCegarLoop]: Abstraction has 789 states and 1139 transitions. [2021-10-28 09:11:46,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,508 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1139 transitions. [2021-10-28 09:11:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-28 09:11:46,511 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:46,512 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:46,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 09:11:46,512 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:46,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:46,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2130964057, now seen corresponding path program 1 times [2021-10-28 09:11:46,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:46,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168320983] [2021-10-28 09:11:46,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:46,516 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:46,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:46,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:46,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168320983] [2021-10-28 09:11:46,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168320983] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:46,563 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:46,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:46,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283916068] [2021-10-28 09:11:46,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:46,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:46,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:46,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:46,566 INFO L87 Difference]: Start difference. First operand 789 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:46,607 INFO L93 Difference]: Finished difference Result 1353 states and 1973 transitions. [2021-10-28 09:11:46,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:46,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-28 09:11:46,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:46,617 INFO L225 Difference]: With dead ends: 1353 [2021-10-28 09:11:46,617 INFO L226 Difference]: Without dead ends: 1351 [2021-10-28 09:11:46,619 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2021-10-28 09:11:46,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1157. [2021-10-28 09:11:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.4005190311418685) internal successors, (1619), 1156 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1619 transitions. [2021-10-28 09:11:46,660 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1619 transitions. Word has length 20 [2021-10-28 09:11:46,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:46,660 INFO L470 AbstractCegarLoop]: Abstraction has 1157 states and 1619 transitions. [2021-10-28 09:11:46,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1619 transitions. [2021-10-28 09:11:46,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-28 09:11:46,663 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:46,665 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:46,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 09:11:46,665 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:46,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:46,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1462938661, now seen corresponding path program 1 times [2021-10-28 09:11:46,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:46,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527734906] [2021-10-28 09:11:46,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:46,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:46,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:46,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:46,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527734906] [2021-10-28 09:11:46,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527734906] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:46,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:46,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:46,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798409339] [2021-10-28 09:11:46,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:46,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:46,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:46,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:46,718 INFO L87 Difference]: Start difference. First operand 1157 states and 1619 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:46,761 INFO L93 Difference]: Finished difference Result 2633 states and 3669 transitions. [2021-10-28 09:11:46,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:46,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-28 09:11:46,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:46,771 INFO L225 Difference]: With dead ends: 2633 [2021-10-28 09:11:46,771 INFO L226 Difference]: Without dead ends: 1511 [2021-10-28 09:11:46,773 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2021-10-28 09:11:46,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1509. [2021-10-28 09:11:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 1.360079575596817) internal successors, (2051), 1508 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2051 transitions. [2021-10-28 09:11:46,831 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2051 transitions. Word has length 20 [2021-10-28 09:11:46,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:46,831 INFO L470 AbstractCegarLoop]: Abstraction has 1509 states and 2051 transitions. [2021-10-28 09:11:46,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2051 transitions. [2021-10-28 09:11:46,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-28 09:11:46,834 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:46,834 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:46,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 09:11:46,835 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:46,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:46,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1635592028, now seen corresponding path program 1 times [2021-10-28 09:11:46,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:46,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401833988] [2021-10-28 09:11:46,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:46,836 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:46,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:46,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401833988] [2021-10-28 09:11:46,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401833988] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:46,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:46,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:46,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156373097] [2021-10-28 09:11:46,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:46,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:46,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:46,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:46,861 INFO L87 Difference]: Start difference. First operand 1509 states and 2051 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:46,913 INFO L93 Difference]: Finished difference Result 2265 states and 3061 transitions. [2021-10-28 09:11:46,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:46,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-28 09:11:46,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:46,923 INFO L225 Difference]: With dead ends: 2265 [2021-10-28 09:11:46,923 INFO L226 Difference]: Without dead ends: 1543 [2021-10-28 09:11:46,924 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:46,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2021-10-28 09:11:46,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1541. [2021-10-28 09:11:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 1.3318181818181818) internal successors, (2051), 1540 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2051 transitions. [2021-10-28 09:11:46,979 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2051 transitions. Word has length 21 [2021-10-28 09:11:46,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:46,980 INFO L470 AbstractCegarLoop]: Abstraction has 1541 states and 2051 transitions. [2021-10-28 09:11:46,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:46,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2051 transitions. [2021-10-28 09:11:46,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-28 09:11:46,983 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:46,983 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:46,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 09:11:46,983 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:46,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:46,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1893757466, now seen corresponding path program 1 times [2021-10-28 09:11:46,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:46,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807080224] [2021-10-28 09:11:46,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:46,985 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:47,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:47,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807080224] [2021-10-28 09:11:47,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807080224] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:47,007 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:47,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:47,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575169231] [2021-10-28 09:11:47,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:47,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:47,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:47,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:47,009 INFO L87 Difference]: Start difference. First operand 1541 states and 2051 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:47,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:47,061 INFO L93 Difference]: Finished difference Result 2569 states and 3429 transitions. [2021-10-28 09:11:47,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:47,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-28 09:11:47,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:47,078 INFO L225 Difference]: With dead ends: 2569 [2021-10-28 09:11:47,078 INFO L226 Difference]: Without dead ends: 2567 [2021-10-28 09:11:47,079 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:47,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2021-10-28 09:11:47,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2309. [2021-10-28 09:11:47,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2308 states have (on average 1.290727902946274) internal successors, (2979), 2308 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 2979 transitions. [2021-10-28 09:11:47,162 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 2979 transitions. Word has length 21 [2021-10-28 09:11:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:47,163 INFO L470 AbstractCegarLoop]: Abstraction has 2309 states and 2979 transitions. [2021-10-28 09:11:47,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:47,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2979 transitions. [2021-10-28 09:11:47,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-28 09:11:47,167 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:47,167 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:47,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 09:11:47,168 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:47,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:47,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1700145252, now seen corresponding path program 1 times [2021-10-28 09:11:47,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:47,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354631123] [2021-10-28 09:11:47,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:47,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:47,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:47,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354631123] [2021-10-28 09:11:47,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354631123] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:47,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:47,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:47,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064819402] [2021-10-28 09:11:47,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:47,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:47,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:47,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:47,191 INFO L87 Difference]: Start difference. First operand 2309 states and 2979 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:47,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:47,303 INFO L93 Difference]: Finished difference Result 5193 states and 6629 transitions. [2021-10-28 09:11:47,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:47,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-28 09:11:47,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:47,321 INFO L225 Difference]: With dead ends: 5193 [2021-10-28 09:11:47,321 INFO L226 Difference]: Without dead ends: 2951 [2021-10-28 09:11:47,324 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:47,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2021-10-28 09:11:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2949. [2021-10-28 09:11:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2948 states have (on average 1.2384667571234735) internal successors, (3651), 2948 states have internal predecessors, (3651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3651 transitions. [2021-10-28 09:11:47,457 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3651 transitions. Word has length 21 [2021-10-28 09:11:47,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:47,457 INFO L470 AbstractCegarLoop]: Abstraction has 2949 states and 3651 transitions. [2021-10-28 09:11:47,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:47,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3651 transitions. [2021-10-28 09:11:47,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-28 09:11:47,463 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:47,463 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:47,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 09:11:47,463 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:47,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:47,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1422844656, now seen corresponding path program 1 times [2021-10-28 09:11:47,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:47,464 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866094415] [2021-10-28 09:11:47,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:47,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:47,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:47,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:47,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866094415] [2021-10-28 09:11:47,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866094415] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:47,487 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:47,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:47,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445076203] [2021-10-28 09:11:47,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:47,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:47,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:47,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:47,488 INFO L87 Difference]: Start difference. First operand 2949 states and 3651 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:47,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:47,551 INFO L93 Difference]: Finished difference Result 4425 states and 5445 transitions. [2021-10-28 09:11:47,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:47,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-28 09:11:47,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:47,569 INFO L225 Difference]: With dead ends: 4425 [2021-10-28 09:11:47,569 INFO L226 Difference]: Without dead ends: 3015 [2021-10-28 09:11:47,572 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:47,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2021-10-28 09:11:47,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 3013. [2021-10-28 09:11:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 3012 states have (on average 1.2121513944223108) internal successors, (3651), 3012 states have internal predecessors, (3651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:47,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 3651 transitions. [2021-10-28 09:11:47,739 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 3651 transitions. Word has length 22 [2021-10-28 09:11:47,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:47,740 INFO L470 AbstractCegarLoop]: Abstraction has 3013 states and 3651 transitions. [2021-10-28 09:11:47,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:47,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 3651 transitions. [2021-10-28 09:11:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-28 09:11:47,745 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:47,745 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:47,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-28 09:11:47,746 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:47,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:47,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1164679218, now seen corresponding path program 1 times [2021-10-28 09:11:47,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:47,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292409298] [2021-10-28 09:11:47,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:47,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:47,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:47,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292409298] [2021-10-28 09:11:47,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292409298] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:47,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:47,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:47,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821187379] [2021-10-28 09:11:47,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:47,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:47,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:47,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:47,776 INFO L87 Difference]: Start difference. First operand 3013 states and 3651 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:47,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:47,896 INFO L93 Difference]: Finished difference Result 4871 states and 5828 transitions. [2021-10-28 09:11:47,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:47,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-28 09:11:47,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:47,925 INFO L225 Difference]: With dead ends: 4871 [2021-10-28 09:11:47,926 INFO L226 Difference]: Without dead ends: 4869 [2021-10-28 09:11:47,927 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:47,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2021-10-28 09:11:48,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4613. [2021-10-28 09:11:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4613 states, 4612 states have (on average 1.180182133564614) internal successors, (5443), 4612 states have internal predecessors, (5443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4613 states to 4613 states and 5443 transitions. [2021-10-28 09:11:48,089 INFO L78 Accepts]: Start accepts. Automaton has 4613 states and 5443 transitions. Word has length 22 [2021-10-28 09:11:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:48,090 INFO L470 AbstractCegarLoop]: Abstraction has 4613 states and 5443 transitions. [2021-10-28 09:11:48,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:48,090 INFO L276 IsEmpty]: Start isEmpty. Operand 4613 states and 5443 transitions. [2021-10-28 09:11:48,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-28 09:11:48,100 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:48,101 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:48,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-28 09:11:48,101 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:48,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:48,104 INFO L85 PathProgramCache]: Analyzing trace with hash -463614640, now seen corresponding path program 1 times [2021-10-28 09:11:48,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:48,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372998403] [2021-10-28 09:11:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:48,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:48,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:48,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:48,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372998403] [2021-10-28 09:11:48,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372998403] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:48,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:48,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:48,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986737130] [2021-10-28 09:11:48,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:48,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:48,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:48,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:48,153 INFO L87 Difference]: Start difference. First operand 4613 states and 5443 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:48,311 INFO L93 Difference]: Finished difference Result 10245 states and 11843 transitions. [2021-10-28 09:11:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:48,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-28 09:11:48,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:48,313 INFO L225 Difference]: With dead ends: 10245 [2021-10-28 09:11:48,313 INFO L226 Difference]: Without dead ends: 0 [2021-10-28 09:11:48,323 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:48,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-28 09:11:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-28 09:11:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:48,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-28 09:11:48,324 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2021-10-28 09:11:48,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:48,324 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 09:11:48,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:48,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-28 09:11:48,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-28 09:11:48,330 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:11:48,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-28 09:11:48,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-28 09:11:48,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:48,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:48,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:48,343 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:48,350 INFO L857 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2021-10-28 09:11:48,350 INFO L857 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2021-10-28 09:11:48,350 INFO L857 garLoopResultBuilder]: For program point L102-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 09:11:48,351 INFO L860 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2021-10-28 09:11:48,351 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-28 09:11:48,351 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-28 09:11:48,351 INFO L857 garLoopResultBuilder]: For program point L86-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 09:11:48,351 INFO L857 garLoopResultBuilder]: For program point L78-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 09:11:48,351 INFO L860 garLoopResultBuilder]: At program point L136(lines 6 137) the Hoare annotation is: true [2021-10-28 09:11:48,352 INFO L857 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2021-10-28 09:11:48,352 INFO L857 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2021-10-28 09:11:48,352 INFO L857 garLoopResultBuilder]: For program point L70-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 09:11:48,352 INFO L857 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2021-10-28 09:11:48,353 INFO L853 garLoopResultBuilder]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2021-10-28 09:11:48,354 INFO L857 garLoopResultBuilder]: For program point L62-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 09:11:48,354 INFO L857 garLoopResultBuilder]: For program point L112-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 09:11:48,355 INFO L857 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2021-10-28 09:11:48,355 INFO L857 garLoopResultBuilder]: For program point L97-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 09:11:48,355 INFO L857 garLoopResultBuilder]: For program point L122-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 09:11:48,355 INFO L857 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2021-10-28 09:11:48,355 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-28 09:11:48,356 INFO L857 garLoopResultBuilder]: For program point L123(line 123) no Hoare annotation was computed. [2021-10-28 09:11:48,356 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) no Hoare annotation was computed. [2021-10-28 09:11:48,356 INFO L857 garLoopResultBuilder]: For program point L82-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 09:11:48,356 INFO L857 garLoopResultBuilder]: For program point L107-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 09:11:48,356 INFO L857 garLoopResultBuilder]: For program point L74-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 09:11:48,357 INFO L857 garLoopResultBuilder]: For program point L66-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 09:11:48,357 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-28 09:11:48,357 INFO L857 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2021-10-28 09:11:48,357 INFO L857 garLoopResultBuilder]: For program point L58-2(lines 35 132) no Hoare annotation was computed. [2021-10-28 09:11:48,357 INFO L857 garLoopResultBuilder]: For program point L108(line 108) no Hoare annotation was computed. [2021-10-28 09:11:48,358 INFO L860 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2021-10-28 09:11:48,358 INFO L857 garLoopResultBuilder]: For program point L92-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 09:11:48,358 INFO L857 garLoopResultBuilder]: For program point L117-1(lines 35 132) no Hoare annotation was computed. [2021-10-28 09:11:48,362 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:48,363 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 09:11:48,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 09:11:48 BoogieIcfgContainer [2021-10-28 09:11:48,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 09:11:48,382 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:11:48,383 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:11:48,383 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:11:48,384 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:11:44" (3/4) ... [2021-10-28 09:11:48,387 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 09:11:48,403 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-28 09:11:48,403 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-28 09:11:48,404 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 09:11:48,404 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 09:11:48,473 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410b830d-24c0-4a86-abb5-a01e8af19789/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:11:48,473 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:11:48,476 INFO L168 Benchmark]: Toolchain (without parser) took 5218.90 ms. Allocated memory was 96.5 MB in the beginning and 174.1 MB in the end (delta: 77.6 MB). Free memory was 63.9 MB in the beginning and 98.7 MB in the end (delta: -34.8 MB). Peak memory consumption was 41.6 MB. Max. memory is 16.1 GB. [2021-10-28 09:11:48,476 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 96.5 MB. Free memory is still 51.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:11:48,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.42 ms. Allocated memory was 96.5 MB in the beginning and 144.7 MB in the end (delta: 48.2 MB). Free memory was 63.9 MB in the beginning and 120.2 MB in the end (delta: -56.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:11:48,477 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.24 ms. Allocated memory is still 144.7 MB. Free memory was 120.2 MB in the beginning and 118.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:11:48,478 INFO L168 Benchmark]: Boogie Preprocessor took 45.56 ms. Allocated memory is still 144.7 MB. Free memory was 118.6 MB in the beginning and 117.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:11:48,478 INFO L168 Benchmark]: RCFGBuilder took 400.08 ms. Allocated memory is still 144.7 MB. Free memory was 117.3 MB in the beginning and 105.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:11:48,479 INFO L168 Benchmark]: TraceAbstraction took 4247.65 ms. Allocated memory was 144.7 MB in the beginning and 174.1 MB in the end (delta: 29.4 MB). Free memory was 104.8 MB in the beginning and 101.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 34.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:11:48,479 INFO L168 Benchmark]: Witness Printer took 91.07 ms. Allocated memory is still 174.1 MB. Free memory was 101.9 MB in the beginning and 98.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:11:48,483 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 96.5 MB. Free memory is still 51.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 366.42 ms. Allocated memory was 96.5 MB in the beginning and 144.7 MB in the end (delta: 48.2 MB). Free memory was 63.9 MB in the beginning and 120.2 MB in the end (delta: -56.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 57.24 ms. Allocated memory is still 144.7 MB. Free memory was 120.2 MB in the beginning and 118.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 45.56 ms. Allocated memory is still 144.7 MB. Free memory was 118.6 MB in the beginning and 117.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 400.08 ms. Allocated memory is still 144.7 MB. Free memory was 117.3 MB in the beginning and 105.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4247.65 ms. Allocated memory was 144.7 MB in the beginning and 174.1 MB in the end (delta: 29.4 MB). Free memory was 104.8 MB in the beginning and 101.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 34.1 MB. Max. memory is 16.1 GB. * Witness Printer took 91.07 ms. Allocated memory is still 174.1 MB. Free memory was 101.9 MB in the beginning and 98.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 135]: 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, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1474 SDtfs, 720 SDslu, 964 SDs, 0 SdLazy, 117 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4613occurred in iteration=21, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 265 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 389 ConstructedInterpolants, 0 QuantifiedInterpolants, 805 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 35]: 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-28 09:11:48,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_410b830d-24c0-4a86-abb5-a01e8af19789/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...