/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/bitvector/byte_add-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:29:29,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:29:29,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:29:29,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:29:29,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:29:29,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:29:29,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:29:29,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:29:29,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:29:29,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:29:29,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:29:29,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:29:29,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:29:29,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:29:29,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:29:29,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:29:29,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:29:29,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:29:29,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:29:29,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:29:29,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:29:29,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:29:29,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:29:29,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:29:29,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:29:29,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:29:29,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:29:29,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:29:29,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:29:29,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:29:29,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:29:29,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:29:29,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:29:29,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:29:29,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:29:29,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:29:29,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:29:29,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:29:29,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:29:29,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:29:29,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:29:29,733 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:29:29,770 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:29:29,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:29:29,772 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:29:29,773 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:29:29,773 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:29:29,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:29:29,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:29:29,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:29:29,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:29:29,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:29:29,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:29:29,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:29:29,775 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:29:29,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:29:29,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:29:29,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:29:29,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:29:29,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:29:29,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:29:29,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:29:29,777 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:29:29,777 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:29:29,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:29:29,777 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:29:29,777 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:29:29,778 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:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/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 [2021-01-06 11:29:30,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:29:30,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:29:30,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:29:30,221 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:29:30,222 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:29:30,223 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-1.i [2021-01-06 11:29:30,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/69432c152/671ca768f3314a5193069a79c6ebf733/FLAG4fb614ddd [2021-01-06 11:29:31,033 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:29:31,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i [2021-01-06 11:29:31,047 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/69432c152/671ca768f3314a5193069a79c6ebf733/FLAG4fb614ddd [2021-01-06 11:29:31,326 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/69432c152/671ca768f3314a5193069a79c6ebf733 [2021-01-06 11:29:31,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:29:31,338 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:29:31,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:29:31,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:29:31,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:29:31,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:29:31" (1/1) ... [2021-01-06 11:29:31,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f2dc5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:29:31, skipping insertion in model container [2021-01-06 11:29:31,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:29:31" (1/1) ... [2021-01-06 11:29:31,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:29:31,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 11:29:31,568 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i[861,874] left hand side expression in assignment: lhs: VariableLHS[~a0~0,] left hand side expression in assignment: lhs: VariableLHS[~a1~0,] left hand side expression in assignment: lhs: VariableLHS[~a2~0,] left hand side expression in assignment: lhs: VariableLHS[~a3~0,] left hand side expression in assignment: lhs: VariableLHS[~b0~0,] left hand side expression in assignment: lhs: VariableLHS[~b1~0,] left hand side expression in assignment: lhs: VariableLHS[~b2~0,] left hand side expression in assignment: lhs: VariableLHS[~b3~0,] left hand side expression in assignment: lhs: VariableLHS[~na~0,] left hand side expression in assignment: lhs: VariableLHS[~na~0,] left hand side expression in assignment: lhs: VariableLHS[~na~0,] left hand side expression in assignment: lhs: VariableLHS[~na~0,] left hand side expression in assignment: lhs: VariableLHS[~nb~0,] left hand side expression in assignment: lhs: VariableLHS[~nb~0,] left hand side expression in assignment: lhs: VariableLHS[~nb~0,] left hand side expression in assignment: lhs: VariableLHS[~nb~0,] left hand side expression in assignment: lhs: VariableLHS[~carry~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] left hand side expression in assignment: lhs: VariableLHS[~carry~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~carry~0,] left hand side expression in assignment: lhs: VariableLHS[~r0~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,] left hand side expression in assignment: lhs: VariableLHS[~r2~0,] left hand side expression in assignment: lhs: VariableLHS[~r3~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~r0~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,] left hand side expression in assignment: lhs: VariableLHS[~r2~0,] left hand side expression in assignment: lhs: VariableLHS[~r3~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~r~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~r~1,] [2021-01-06 11:29:31,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:29:31,647 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 11:29:31,666 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i[861,874] left hand side expression in assignment: lhs: VariableLHS[~a0~0,] left hand side expression in assignment: lhs: VariableLHS[~a1~0,] left hand side expression in assignment: lhs: VariableLHS[~a2~0,] left hand side expression in assignment: lhs: VariableLHS[~a3~0,] left hand side expression in assignment: lhs: VariableLHS[~b0~0,] left hand side expression in assignment: lhs: VariableLHS[~b1~0,] left hand side expression in assignment: lhs: VariableLHS[~b2~0,] left hand side expression in assignment: lhs: VariableLHS[~b3~0,] left hand side expression in assignment: lhs: VariableLHS[~na~0,] left hand side expression in assignment: lhs: VariableLHS[~na~0,] left hand side expression in assignment: lhs: VariableLHS[~na~0,] left hand side expression in assignment: lhs: VariableLHS[~na~0,] left hand side expression in assignment: lhs: VariableLHS[~nb~0,] left hand side expression in assignment: lhs: VariableLHS[~nb~0,] left hand side expression in assignment: lhs: VariableLHS[~nb~0,] left hand side expression in assignment: lhs: VariableLHS[~nb~0,] left hand side expression in assignment: lhs: VariableLHS[~carry~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] left hand side expression in assignment: lhs: VariableLHS[~carry~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] left hand side expression in assignment: lhs: VariableLHS[~partial_sum~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~carry~0,] left hand side expression in assignment: lhs: VariableLHS[~r0~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,] left hand side expression in assignment: lhs: VariableLHS[~r2~0,] left hand side expression in assignment: lhs: VariableLHS[~r3~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~r0~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,] left hand side expression in assignment: lhs: VariableLHS[~r2~0,] left hand side expression in assignment: lhs: VariableLHS[~r3~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~r~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~r~1,] [2021-01-06 11:29:31,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:29:31,720 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:29:31,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:29:31 WrapperNode [2021-01-06 11:29:31,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:29:31,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:29:31,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:29:31,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:29:31,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:29:31" (1/1) ... [2021-01-06 11:29:31,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:29:31" (1/1) ... [2021-01-06 11:29:31,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:29:31,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:29:31,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:29:31,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:29:31,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:29:31" (1/1) ... [2021-01-06 11:29:31,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:29:31" (1/1) ... [2021-01-06 11:29:31,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:29:31" (1/1) ... [2021-01-06 11:29:31,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:29:31" (1/1) ... [2021-01-06 11:29:31,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:29:31" (1/1) ... [2021-01-06 11:29:31,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:29:31" (1/1) ... [2021-01-06 11:29:31,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:29:31" (1/1) ... [2021-01-06 11:29:31,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:29:31,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:29:31,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:29:31,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:29:31,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:29:31" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:29:32,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:29:32,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:29:32,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:29:32,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:29:33,100 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:29:33,100 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-01-06 11:29:33,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:29:33 BoogieIcfgContainer [2021-01-06 11:29:33,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:29:33,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:29:33,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:29:33,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:29:33,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:29:31" (1/3) ... [2021-01-06 11:29:33,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29532267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:29:33, skipping insertion in model container [2021-01-06 11:29:33,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:29:31" (2/3) ... [2021-01-06 11:29:33,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29532267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:29:33, skipping insertion in model container [2021-01-06 11:29:33,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:29:33" (3/3) ... [2021-01-06 11:29:33,113 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add-1.i [2021-01-06 11:29:33,121 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:29:33,127 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:29:33,150 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:29:33,182 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:29:33,182 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:29:33,182 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:29:33,182 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:29:33,183 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:29:33,183 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:29:33,183 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:29:33,183 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:29:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2021-01-06 11:29:33,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-06 11:29:33,212 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:29:33,213 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:29:33,214 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:29:33,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:29:33,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1979526715, now seen corresponding path program 1 times [2021-01-06 11:29:33,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:29:33,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873464910] [2021-01-06 11:29:33,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:29:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:29:33,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873464910] [2021-01-06 11:29:33,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:29:33,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:29:33,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652361603] [2021-01-06 11:29:33,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 11:29:33,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:29:33,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 11:29:33,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 11:29:33,539 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2021-01-06 11:29:33,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:29:33,581 INFO L93 Difference]: Finished difference Result 92 states and 160 transitions. [2021-01-06 11:29:33,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 11:29:33,583 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2021-01-06 11:29:33,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:29:33,614 INFO L225 Difference]: With dead ends: 92 [2021-01-06 11:29:33,614 INFO L226 Difference]: Without dead ends: 47 [2021-01-06 11:29:33,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 11:29:33,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-01-06 11:29:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-01-06 11:29:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2021-01-06 11:29:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2021-01-06 11:29:33,664 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 13 [2021-01-06 11:29:33,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:29:33,665 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 78 transitions. [2021-01-06 11:29:33,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 11:29:33,665 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2021-01-06 11:29:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-06 11:29:33,666 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:29:33,667 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:29:33,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:29:33,667 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:29:33,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:29:33,669 INFO L82 PathProgramCache]: Analyzing trace with hash 726479629, now seen corresponding path program 1 times [2021-01-06 11:29:33,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:29:33,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766341367] [2021-01-06 11:29:33,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:29:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:29:33,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766341367] [2021-01-06 11:29:33,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:29:33,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:29:33,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038973465] [2021-01-06 11:29:33,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:29:33,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:29:33,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:29:33,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:29:33,908 INFO L87 Difference]: Start difference. First operand 47 states and 78 transitions. Second operand 3 states. [2021-01-06 11:29:34,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:29:34,142 INFO L93 Difference]: Finished difference Result 112 states and 190 transitions. [2021-01-06 11:29:34,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:29:34,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2021-01-06 11:29:34,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:29:34,145 INFO L225 Difference]: With dead ends: 112 [2021-01-06 11:29:34,145 INFO L226 Difference]: Without dead ends: 75 [2021-01-06 11:29:34,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:29:34,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-01-06 11:29:34,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2021-01-06 11:29:34,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-01-06 11:29:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2021-01-06 11:29:34,160 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 13 [2021-01-06 11:29:34,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:29:34,161 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2021-01-06 11:29:34,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:29:34,161 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2021-01-06 11:29:34,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 11:29:34,163 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:29:34,163 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:29:34,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:29:34,164 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:29:34,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:29:34,165 INFO L82 PathProgramCache]: Analyzing trace with hash 727939832, now seen corresponding path program 1 times [2021-01-06 11:29:34,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:29:34,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424038493] [2021-01-06 11:29:34,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:29:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:34,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:29:34,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424038493] [2021-01-06 11:29:34,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:29:34,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:29:34,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273195693] [2021-01-06 11:29:34,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:29:34,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:29:34,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:29:34,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:29:34,400 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. Second operand 4 states. [2021-01-06 11:29:34,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:29:34,699 INFO L93 Difference]: Finished difference Result 184 states and 301 transitions. [2021-01-06 11:29:34,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:29:34,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2021-01-06 11:29:34,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:29:34,702 INFO L225 Difference]: With dead ends: 184 [2021-01-06 11:29:34,703 INFO L226 Difference]: Without dead ends: 147 [2021-01-06 11:29:34,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:29:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-01-06 11:29:34,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 101. [2021-01-06 11:29:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2021-01-06 11:29:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2021-01-06 11:29:34,718 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 19 [2021-01-06 11:29:34,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:29:34,718 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2021-01-06 11:29:34,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:29:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2021-01-06 11:29:34,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 11:29:34,720 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:29:34,720 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:29:34,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:29:34,721 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:29:34,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:29:34,722 INFO L82 PathProgramCache]: Analyzing trace with hash -302552601, now seen corresponding path program 1 times [2021-01-06 11:29:34,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:29:34,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605956356] [2021-01-06 11:29:34,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:29:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:34,836 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 11:29:34,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605956356] [2021-01-06 11:29:34,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:29:34,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:29:34,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921162437] [2021-01-06 11:29:34,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:29:34,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:29:34,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:29:34,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:29:34,840 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand 4 states. [2021-01-06 11:29:35,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:29:35,046 INFO L93 Difference]: Finished difference Result 302 states and 441 transitions. [2021-01-06 11:29:35,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:29:35,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2021-01-06 11:29:35,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:29:35,048 INFO L225 Difference]: With dead ends: 302 [2021-01-06 11:29:35,049 INFO L226 Difference]: Without dead ends: 214 [2021-01-06 11:29:35,050 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:29:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-01-06 11:29:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 108. [2021-01-06 11:29:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-01-06 11:29:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2021-01-06 11:29:35,063 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 25 [2021-01-06 11:29:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:29:35,063 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2021-01-06 11:29:35,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:29:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2021-01-06 11:29:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 11:29:35,065 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:29:35,065 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:29:35,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:29:35,066 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:29:35,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:29:35,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1128243813, now seen corresponding path program 1 times [2021-01-06 11:29:35,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:29:35,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512252536] [2021-01-06 11:29:35,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:29:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:35,190 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 11:29:35,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512252536] [2021-01-06 11:29:35,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:29:35,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:29:35,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789390223] [2021-01-06 11:29:35,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:29:35,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:29:35,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:29:35,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:29:35,196 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand 4 states. [2021-01-06 11:29:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:29:35,459 INFO L93 Difference]: Finished difference Result 308 states and 447 transitions. [2021-01-06 11:29:35,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:29:35,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2021-01-06 11:29:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:29:35,465 INFO L225 Difference]: With dead ends: 308 [2021-01-06 11:29:35,465 INFO L226 Difference]: Without dead ends: 220 [2021-01-06 11:29:35,470 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:29:35,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-01-06 11:29:35,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 119. [2021-01-06 11:29:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2021-01-06 11:29:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2021-01-06 11:29:35,502 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 26 [2021-01-06 11:29:35,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:29:35,502 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2021-01-06 11:29:35,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:29:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2021-01-06 11:29:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 11:29:35,506 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:29:35,506 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:29:35,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:29:35,506 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:29:35,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:29:35,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1070765944, now seen corresponding path program 1 times [2021-01-06 11:29:35,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:29:35,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747286766] [2021-01-06 11:29:35,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:29:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:29:35,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747286766] [2021-01-06 11:29:35,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681116850] [2021-01-06 11:29:35,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:29:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:35,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 11:29:35,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:29:35,926 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 11:29:35,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:29:35,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-01-06 11:29:35,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827434180] [2021-01-06 11:29:35,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:29:35,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:29:35,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:29:35,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:29:35,929 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand 4 states. [2021-01-06 11:29:36,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:29:36,318 INFO L93 Difference]: Finished difference Result 265 states and 403 transitions. [2021-01-06 11:29:36,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:29:36,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2021-01-06 11:29:36,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:29:36,320 INFO L225 Difference]: With dead ends: 265 [2021-01-06 11:29:36,321 INFO L226 Difference]: Without dead ends: 179 [2021-01-06 11:29:36,321 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:29:36,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-01-06 11:29:36,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 158. [2021-01-06 11:29:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2021-01-06 11:29:36,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 219 transitions. [2021-01-06 11:29:36,331 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 219 transitions. Word has length 27 [2021-01-06 11:29:36,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:29:36,331 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 219 transitions. [2021-01-06 11:29:36,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:29:36,332 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 219 transitions. [2021-01-06 11:29:36,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 11:29:36,334 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:29:36,334 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:29:36,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-01-06 11:29:36,550 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:29:36,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:29:36,555 INFO L82 PathProgramCache]: Analyzing trace with hash 348727971, now seen corresponding path program 1 times [2021-01-06 11:29:36,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:29:36,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989663897] [2021-01-06 11:29:36,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:29:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:36,765 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:29:36,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989663897] [2021-01-06 11:29:36,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925395745] [2021-01-06 11:29:36,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:29:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:36,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 11:29:36,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:29:37,049 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 11:29:37,206 INFO L757 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 11:29:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-06 11:29:37,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:29:37,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2021-01-06 11:29:37,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372205985] [2021-01-06 11:29:37,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:29:37,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:29:37,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:29:37,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:29:37,810 INFO L87 Difference]: Start difference. First operand 158 states and 219 transitions. Second operand 4 states. [2021-01-06 11:29:40,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:29:40,793 INFO L93 Difference]: Finished difference Result 343 states and 491 transitions. [2021-01-06 11:29:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:29:40,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2021-01-06 11:29:40,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:29:40,796 INFO L225 Difference]: With dead ends: 343 [2021-01-06 11:29:40,797 INFO L226 Difference]: Without dead ends: 218 [2021-01-06 11:29:40,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:29:40,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-01-06 11:29:40,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 186. [2021-01-06 11:29:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2021-01-06 11:29:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 252 transitions. [2021-01-06 11:29:40,810 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 252 transitions. Word has length 33 [2021-01-06 11:29:40,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:29:40,810 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 252 transitions. [2021-01-06 11:29:40,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:29:40,811 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 252 transitions. [2021-01-06 11:29:40,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 11:29:40,813 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:29:40,813 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:29:41,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:29:41,027 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:29:41,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:29:41,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1220015570, now seen corresponding path program 1 times [2021-01-06 11:29:41,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:29:41,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095450499] [2021-01-06 11:29:41,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:29:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 11:29:41,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095450499] [2021-01-06 11:29:41,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:29:41,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:29:41,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172664190] [2021-01-06 11:29:41,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:29:41,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:29:41,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:29:41,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:29:41,360 INFO L87 Difference]: Start difference. First operand 186 states and 252 transitions. Second operand 5 states. [2021-01-06 11:29:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:29:41,462 INFO L93 Difference]: Finished difference Result 240 states and 317 transitions. [2021-01-06 11:29:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:29:41,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2021-01-06 11:29:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:29:41,466 INFO L225 Difference]: With dead ends: 240 [2021-01-06 11:29:41,466 INFO L226 Difference]: Without dead ends: 235 [2021-01-06 11:29:41,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:29:41,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-01-06 11:29:41,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 216. [2021-01-06 11:29:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2021-01-06 11:29:41,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 291 transitions. [2021-01-06 11:29:41,482 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 291 transitions. Word has length 39 [2021-01-06 11:29:41,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:29:41,483 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 291 transitions. [2021-01-06 11:29:41,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:29:41,483 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 291 transitions. [2021-01-06 11:29:41,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-06 11:29:41,486 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:29:41,486 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:29:41,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:29:41,487 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:29:41,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:29:41,488 INFO L82 PathProgramCache]: Analyzing trace with hash -789956283, now seen corresponding path program 1 times [2021-01-06 11:29:41,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:29:41,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887742517] [2021-01-06 11:29:41,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:29:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-01-06 11:29:41,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887742517] [2021-01-06 11:29:41,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:29:41,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:29:41,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284158153] [2021-01-06 11:29:41,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:29:41,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:29:41,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:29:41,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:29:41,617 INFO L87 Difference]: Start difference. First operand 216 states and 291 transitions. Second operand 5 states. [2021-01-06 11:29:42,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:29:42,146 INFO L93 Difference]: Finished difference Result 828 states and 1104 transitions. [2021-01-06 11:29:42,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:29:42,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2021-01-06 11:29:42,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:29:42,152 INFO L225 Difference]: With dead ends: 828 [2021-01-06 11:29:42,153 INFO L226 Difference]: Without dead ends: 642 [2021-01-06 11:29:42,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:29:42,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2021-01-06 11:29:42,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 216. [2021-01-06 11:29:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2021-01-06 11:29:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 291 transitions. [2021-01-06 11:29:42,176 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 291 transitions. Word has length 40 [2021-01-06 11:29:42,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:29:42,177 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 291 transitions. [2021-01-06 11:29:42,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:29:42,177 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 291 transitions. [2021-01-06 11:29:42,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 11:29:42,186 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:29:42,187 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:29:42,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:29:42,187 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:29:42,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:29:42,189 INFO L82 PathProgramCache]: Analyzing trace with hash 379502396, now seen corresponding path program 1 times [2021-01-06 11:29:42,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:29:42,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125465224] [2021-01-06 11:29:42,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:29:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-01-06 11:29:42,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125465224] [2021-01-06 11:29:42,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:29:42,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:29:42,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071022917] [2021-01-06 11:29:42,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:29:42,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:29:42,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:29:42,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:29:42,345 INFO L87 Difference]: Start difference. First operand 216 states and 291 transitions. Second operand 5 states. [2021-01-06 11:29:42,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:29:42,851 INFO L93 Difference]: Finished difference Result 808 states and 1079 transitions. [2021-01-06 11:29:42,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:29:42,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2021-01-06 11:29:42,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:29:42,855 INFO L225 Difference]: With dead ends: 808 [2021-01-06 11:29:42,856 INFO L226 Difference]: Without dead ends: 623 [2021-01-06 11:29:42,857 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:29:42,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2021-01-06 11:29:42,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 216. [2021-01-06 11:29:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2021-01-06 11:29:42,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 291 transitions. [2021-01-06 11:29:42,869 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 291 transitions. Word has length 41 [2021-01-06 11:29:42,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:29:42,869 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 291 transitions. [2021-01-06 11:29:42,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:29:42,869 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 291 transitions. [2021-01-06 11:29:42,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-06 11:29:42,870 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:29:42,870 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:29:42,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:29:42,871 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:29:42,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:29:42,871 INFO L82 PathProgramCache]: Analyzing trace with hash 814136362, now seen corresponding path program 1 times [2021-01-06 11:29:42,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:29:42,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159347935] [2021-01-06 11:29:42,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:29:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-01-06 11:29:42,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159347935] [2021-01-06 11:29:42,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:29:42,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 11:29:42,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450258393] [2021-01-06 11:29:42,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 11:29:42,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:29:42,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 11:29:42,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:29:42,990 INFO L87 Difference]: Start difference. First operand 216 states and 291 transitions. Second operand 6 states. [2021-01-06 11:29:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:29:43,660 INFO L93 Difference]: Finished difference Result 1017 states and 1354 transitions. [2021-01-06 11:29:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 11:29:43,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2021-01-06 11:29:43,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:29:43,666 INFO L225 Difference]: With dead ends: 1017 [2021-01-06 11:29:43,667 INFO L226 Difference]: Without dead ends: 832 [2021-01-06 11:29:43,668 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-01-06 11:29:43,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2021-01-06 11:29:43,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 216. [2021-01-06 11:29:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2021-01-06 11:29:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 291 transitions. [2021-01-06 11:29:43,681 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 291 transitions. Word has length 42 [2021-01-06 11:29:43,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:29:43,681 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 291 transitions. [2021-01-06 11:29:43,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 11:29:43,682 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 291 transitions. [2021-01-06 11:29:43,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-06 11:29:43,683 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:29:43,683 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:29:43,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:29:43,683 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:29:43,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:29:43,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1236847636, now seen corresponding path program 1 times [2021-01-06 11:29:43,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:29:43,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124486444] [2021-01-06 11:29:43,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:29:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-01-06 11:29:43,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124486444] [2021-01-06 11:29:43,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:29:43,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 11:29:43,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074242568] [2021-01-06 11:29:43,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:29:43,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:29:43,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:29:43,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:29:43,796 INFO L87 Difference]: Start difference. First operand 216 states and 291 transitions. Second operand 7 states. [2021-01-06 11:29:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:29:44,643 INFO L93 Difference]: Finished difference Result 1063 states and 1411 transitions. [2021-01-06 11:29:44,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 11:29:44,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2021-01-06 11:29:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:29:44,649 INFO L225 Difference]: With dead ends: 1063 [2021-01-06 11:29:44,649 INFO L226 Difference]: Without dead ends: 877 [2021-01-06 11:29:44,650 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-01-06 11:29:44,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2021-01-06 11:29:44,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 204. [2021-01-06 11:29:44,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2021-01-06 11:29:44,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 273 transitions. [2021-01-06 11:29:44,664 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 273 transitions. Word has length 42 [2021-01-06 11:29:44,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:29:44,664 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 273 transitions. [2021-01-06 11:29:44,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:29:44,664 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 273 transitions. [2021-01-06 11:29:44,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-06 11:29:44,666 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:29:44,666 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:29:44,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:29:44,666 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:29:44,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:29:44,667 INFO L82 PathProgramCache]: Analyzing trace with hash 757506760, now seen corresponding path program 1 times [2021-01-06 11:29:44,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:29:44,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848645330] [2021-01-06 11:29:44,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:29:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-06 11:29:44,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848645330] [2021-01-06 11:29:44,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257048232] [2021-01-06 11:29:44,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:29:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:44,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-06 11:29:44,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:29:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-06 11:29:45,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:29:45,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2021-01-06 11:29:45,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459794722] [2021-01-06 11:29:45,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:29:45,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:29:45,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:29:45,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:29:45,044 INFO L87 Difference]: Start difference. First operand 204 states and 273 transitions. Second operand 5 states. [2021-01-06 11:29:45,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:29:45,258 INFO L93 Difference]: Finished difference Result 589 states and 791 transitions. [2021-01-06 11:29:45,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:29:45,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2021-01-06 11:29:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:29:45,261 INFO L225 Difference]: With dead ends: 589 [2021-01-06 11:29:45,262 INFO L226 Difference]: Without dead ends: 364 [2021-01-06 11:29:45,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-01-06 11:29:45,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-01-06 11:29:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 350. [2021-01-06 11:29:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2021-01-06 11:29:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 459 transitions. [2021-01-06 11:29:45,277 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 459 transitions. Word has length 46 [2021-01-06 11:29:45,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:29:45,277 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 459 transitions. [2021-01-06 11:29:45,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:29:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 459 transitions. [2021-01-06 11:29:45,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 11:29:45,278 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:29:45,278 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:29:45,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-06 11:29:45,492 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:29:45,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:29:45,492 INFO L82 PathProgramCache]: Analyzing trace with hash -343718646, now seen corresponding path program 1 times [2021-01-06 11:29:45,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:29:45,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118877637] [2021-01-06 11:29:45,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:29:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-06 11:29:45,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118877637] [2021-01-06 11:29:45,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366797340] [2021-01-06 11:29:45,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:29:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:45,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-06 11:29:45,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:29:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-06 11:29:46,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:29:46,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2021-01-06 11:29:46,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597483262] [2021-01-06 11:29:46,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:29:46,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:29:46,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:29:46,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-01-06 11:29:46,121 INFO L87 Difference]: Start difference. First operand 350 states and 459 transitions. Second operand 5 states. [2021-01-06 11:29:46,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:29:46,512 INFO L93 Difference]: Finished difference Result 987 states and 1313 transitions. [2021-01-06 11:29:46,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 11:29:46,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2021-01-06 11:29:46,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:29:46,517 INFO L225 Difference]: With dead ends: 987 [2021-01-06 11:29:46,517 INFO L226 Difference]: Without dead ends: 646 [2021-01-06 11:29:46,518 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-01-06 11:29:46,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2021-01-06 11:29:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 529. [2021-01-06 11:29:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2021-01-06 11:29:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 691 transitions. [2021-01-06 11:29:46,541 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 691 transitions. Word has length 47 [2021-01-06 11:29:46,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:29:46,542 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 691 transitions. [2021-01-06 11:29:46,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:29:46,542 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 691 transitions. [2021-01-06 11:29:46,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 11:29:46,543 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:29:46,543 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:29:46,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:29:46,751 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:29:46,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:29:46,753 INFO L82 PathProgramCache]: Analyzing trace with hash -907973837, now seen corresponding path program 1 times [2021-01-06 11:29:46,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:29:46,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39144237] [2021-01-06 11:29:46,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:29:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:46,938 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-01-06 11:29:46,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39144237] [2021-01-06 11:29:46,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:29:46,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 11:29:46,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110029843] [2021-01-06 11:29:46,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:29:46,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:29:46,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:29:46,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:29:46,941 INFO L87 Difference]: Start difference. First operand 529 states and 691 transitions. Second operand 7 states. [2021-01-06 11:29:47,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:29:47,761 INFO L93 Difference]: Finished difference Result 2673 states and 3462 transitions. [2021-01-06 11:29:47,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 11:29:47,762 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2021-01-06 11:29:47,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:29:47,773 INFO L225 Difference]: With dead ends: 2673 [2021-01-06 11:29:47,774 INFO L226 Difference]: Without dead ends: 2197 [2021-01-06 11:29:47,776 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-01-06 11:29:47,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2021-01-06 11:29:47,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 517. [2021-01-06 11:29:47,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2021-01-06 11:29:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 679 transitions. [2021-01-06 11:29:47,808 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 679 transitions. Word has length 48 [2021-01-06 11:29:47,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:29:47,809 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 679 transitions. [2021-01-06 11:29:47,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:29:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 679 transitions. [2021-01-06 11:29:47,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 11:29:47,810 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:29:47,810 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:29:47,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:29:47,811 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:29:47,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:29:47,811 INFO L82 PathProgramCache]: Analyzing trace with hash 545900084, now seen corresponding path program 1 times [2021-01-06 11:29:47,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:29:47,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599427916] [2021-01-06 11:29:47,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:29:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-06 11:29:47,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599427916] [2021-01-06 11:29:47,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:29:47,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:29:47,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884694053] [2021-01-06 11:29:47,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:29:47,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:29:47,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:29:47,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:29:47,914 INFO L87 Difference]: Start difference. First operand 517 states and 679 transitions. Second operand 5 states. [2021-01-06 11:29:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:29:48,184 INFO L93 Difference]: Finished difference Result 1618 states and 2115 transitions. [2021-01-06 11:29:48,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:29:48,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2021-01-06 11:29:48,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:29:48,193 INFO L225 Difference]: With dead ends: 1618 [2021-01-06 11:29:48,193 INFO L226 Difference]: Without dead ends: 1036 [2021-01-06 11:29:48,201 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:29:48,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2021-01-06 11:29:48,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 950. [2021-01-06 11:29:48,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2021-01-06 11:29:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1227 transitions. [2021-01-06 11:29:48,246 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1227 transitions. Word has length 50 [2021-01-06 11:29:48,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:29:48,247 INFO L481 AbstractCegarLoop]: Abstraction has 950 states and 1227 transitions. [2021-01-06 11:29:48,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:29:48,248 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1227 transitions. [2021-01-06 11:29:48,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 11:29:48,249 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:29:48,250 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:29:48,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:29:48,250 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:29:48,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:29:48,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1067562737, now seen corresponding path program 1 times [2021-01-06 11:29:48,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:29:48,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567321571] [2021-01-06 11:29:48,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:29:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-06 11:29:48,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567321571] [2021-01-06 11:29:48,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295896803] [2021-01-06 11:29:48,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:29:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:48,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 11:29:48,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:29:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-06 11:29:48,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:29:48,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2021-01-06 11:29:48,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349730092] [2021-01-06 11:29:48,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 11:29:48,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:29:48,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 11:29:48,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-01-06 11:29:48,820 INFO L87 Difference]: Start difference. First operand 950 states and 1227 transitions. Second operand 6 states. [2021-01-06 11:29:49,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:29:49,279 INFO L93 Difference]: Finished difference Result 2212 states and 2867 transitions. [2021-01-06 11:29:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 11:29:49,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2021-01-06 11:29:49,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:29:49,289 INFO L225 Difference]: With dead ends: 2212 [2021-01-06 11:29:49,289 INFO L226 Difference]: Without dead ends: 1660 [2021-01-06 11:29:49,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-01-06 11:29:49,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2021-01-06 11:29:49,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1354. [2021-01-06 11:29:49,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1354 states. [2021-01-06 11:29:49,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1744 transitions. [2021-01-06 11:29:49,353 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1744 transitions. Word has length 51 [2021-01-06 11:29:49,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:29:49,353 INFO L481 AbstractCegarLoop]: Abstraction has 1354 states and 1744 transitions. [2021-01-06 11:29:49,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 11:29:49,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1744 transitions. [2021-01-06 11:29:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 11:29:49,356 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:29:49,357 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:29:49,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-06 11:29:49,571 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:29:49,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:29:49,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1914270845, now seen corresponding path program 1 times [2021-01-06 11:29:49,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:29:49,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854946719] [2021-01-06 11:29:49,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:29:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-06 11:29:49,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854946719] [2021-01-06 11:29:49,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303849453] [2021-01-06 11:29:49,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:29:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:29:49,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 15 conjunts are in the unsatisfiable core [2021-01-06 11:29:49,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:29:50,032 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: variable got div captured [2021-01-06 11:29:50,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:29:50,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2021-01-06 11:29:50,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335241805] [2021-01-06 11:29:50,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 11:29:50,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:29:50,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 11:29:50,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-01-06 11:29:50,034 INFO L87 Difference]: Start difference. First operand 1354 states and 1744 transitions. Second operand 8 states. [2021-01-06 11:29:51,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:29:51,125 INFO L93 Difference]: Finished difference Result 3454 states and 4454 transitions. [2021-01-06 11:29:51,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 11:29:51,126 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2021-01-06 11:29:51,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:29:51,144 INFO L225 Difference]: With dead ends: 3454 [2021-01-06 11:29:51,145 INFO L226 Difference]: Without dead ends: 2888 [2021-01-06 11:29:51,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-01-06 11:29:51,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2021-01-06 11:29:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2191. [2021-01-06 11:29:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2191 states. [2021-01-06 11:29:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 2833 transitions. [2021-01-06 11:29:51,253 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 2833 transitions. Word has length 52 [2021-01-06 11:29:51,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:29:51,254 INFO L481 AbstractCegarLoop]: Abstraction has 2191 states and 2833 transitions. [2021-01-06 11:29:51,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 11:29:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 2833 transitions. [2021-01-06 11:29:51,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 11:29:51,257 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:29:51,257 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:29:51,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-06 11:29:51,471 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:29:51,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:29:51,472 INFO L82 PathProgramCache]: Analyzing trace with hash -331308609, now seen corresponding path program 1 times [2021-01-06 11:29:51,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:29:51,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506759365] [2021-01-06 11:29:51,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:29:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:29:51,523 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:29:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:29:51,558 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:29:51,599 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:29:51,599 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:29:51,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:29:51,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:29:51 BoogieIcfgContainer [2021-01-06 11:29:51,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:29:51,717 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:29:51,717 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:29:51,718 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:29:51,718 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:29:33" (3/4) ... [2021-01-06 11:29:51,723 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-01-06 11:29:51,723 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:29:51,725 INFO L168 Benchmark]: Toolchain (without parser) took 20387.80 ms. Allocated memory was 155.2 MB in the beginning and 240.1 MB in the end (delta: 84.9 MB). Free memory was 129.5 MB in the beginning and 86.7 MB in the end (delta: 42.8 MB). Peak memory consumption was 128.6 MB. Max. memory is 8.0 GB. [2021-01-06 11:29:51,726 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 155.2 MB. Free memory is still 128.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:29:51,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.12 ms. Allocated memory is still 155.2 MB. Free memory was 129.4 MB in the beginning and 117.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-01-06 11:29:51,727 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.03 ms. Allocated memory is still 155.2 MB. Free memory was 117.4 MB in the beginning and 109.3 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2021-01-06 11:29:51,727 INFO L168 Benchmark]: Boogie Preprocessor took 139.91 ms. Allocated memory is still 155.2 MB. Free memory was 109.3 MB in the beginning and 104.3 MB in the end (delta: 5.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:29:51,728 INFO L168 Benchmark]: RCFGBuilder took 1120.92 ms. Allocated memory is still 155.2 MB. Free memory was 104.3 MB in the beginning and 93.9 MB in the end (delta: 10.3 MB). Peak memory consumption was 11.8 MB. Max. memory is 8.0 GB. [2021-01-06 11:29:51,728 INFO L168 Benchmark]: TraceAbstraction took 18611.32 ms. Allocated memory was 155.2 MB in the beginning and 240.1 MB in the end (delta: 84.9 MB). Free memory was 93.4 MB in the beginning and 87.2 MB in the end (delta: 6.2 MB). Peak memory consumption was 91.6 MB. Max. memory is 8.0 GB. [2021-01-06 11:29:51,729 INFO L168 Benchmark]: Witness Printer took 5.87 ms. Allocated memory is still 240.1 MB. Free memory was 87.2 MB in the beginning and 86.7 MB in the end (delta: 522.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:29:51,732 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 155.2 MB. Free memory is still 128.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 380.12 ms. Allocated memory is still 155.2 MB. Free memory was 129.4 MB in the beginning and 117.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 116.03 ms. Allocated memory is still 155.2 MB. Free memory was 117.4 MB in the beginning and 109.3 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 139.91 ms. Allocated memory is still 155.2 MB. Free memory was 109.3 MB in the beginning and 104.3 MB in the end (delta: 5.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1120.92 ms. Allocated memory is still 155.2 MB. Free memory was 104.3 MB in the beginning and 93.9 MB in the end (delta: 10.3 MB). Peak memory consumption was 11.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 18611.32 ms. Allocated memory was 155.2 MB in the beginning and 240.1 MB in the end (delta: 84.9 MB). Free memory was 93.4 MB in the beginning and 87.2 MB in the end (delta: 6.2 MB). Peak memory consumption was 91.6 MB. Max. memory is 8.0 GB. * Witness Printer took 5.87 ms. Allocated memory is still 240.1 MB. Free memory was 87.2 MB in the beginning and 86.7 MB in the end (delta: 522.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 108. Possible FailurePath: [L116] unsigned int a, b, r; [L118] a = __VERIFIER_nondet_uint() [L119] b = __VERIFIER_nondet_uint() [L34] unsigned char a0, a1, a2, a3; [L35] unsigned char b0, b1, b2, b3; [L36] unsigned char r0, r1, r2, r3; [L37] unsigned short carry; [L38] unsigned short partial_sum; [L39] unsigned int r; [L40] unsigned char i; [L41] unsigned char na, nb; [L42] a0 = a [L43] a1 = a >> 8 [L44] a2 = a >> 16U [L45] a3 = a >> 24U [L46] b0 = b [L47] b1 = b >> 8U [L48] b2 = b >> 16U [L49] b3 = b >> 24U [L50] na = (unsigned char)4 [L51] COND TRUE a3 == (unsigned char)0 [L52] na = na - 1 [L53] COND TRUE a2 == (unsigned char)0 [L54] na = na - 1 [L55] COND TRUE a1 == (unsigned char)0 [L56] na = na - 1 [L60] nb = (unsigned char)4 [L61] COND TRUE b3 == (unsigned char)0 [L62] nb = nb - 1 [L63] COND TRUE b2 == (unsigned char)0 [L64] nb = nb - 1 [L65] COND TRUE b1 == (unsigned char)0 [L66] nb = nb - 1 [L70] carry = (unsigned short)0 [L71] i = (unsigned char)0 [L72] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L73] partial_sum = carry [L74] carry = (unsigned short)0 [L75] COND TRUE i < na [L76] COND TRUE i == (unsigned char)0 [L76] partial_sum = partial_sum + a0 [L77] COND FALSE !(i == (unsigned char)1) [L78] COND FALSE !(i == (unsigned char)2) [L79] COND FALSE !(i == (unsigned char)3) [L81] COND TRUE i < nb [L82] COND TRUE i == (unsigned char)0 [L82] partial_sum = partial_sum + b0 [L83] COND FALSE !(i == (unsigned char)1) [L84] COND FALSE !(i == (unsigned char)2) [L85] COND FALSE !(i == (unsigned char)3) [L87] COND FALSE !(partial_sum > ((unsigned char)254)) [L91] COND TRUE i == (unsigned char)0 [L91] r0 = (unsigned char)partial_sum [L92] COND FALSE !(i == (unsigned char)1) [L93] COND FALSE !(i == (unsigned char)2) [L94] COND FALSE !(i == (unsigned char)3) [L96] i = i + (unsigned char)1 [L72] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) [L99] COND TRUE i < (unsigned char)4 [L100] COND FALSE !(i == (unsigned char)0) [L101] COND TRUE i == (unsigned char)1 [L101] r1 = (unsigned char)0 [L102] COND FALSE !(i == (unsigned char)2) [L103] COND FALSE !(i == (unsigned char)3) [L105] i = i + (unsigned char)1 [L99] COND TRUE i < (unsigned char)4 [L100] COND FALSE !(i == (unsigned char)0) [L101] COND FALSE !(i == (unsigned char)1) [L102] COND TRUE i == (unsigned char)2 [L102] r2 = (unsigned char)0 [L103] COND FALSE !(i == (unsigned char)3) [L105] i = i + (unsigned char)1 [L99] COND TRUE i < (unsigned char)4 [L100] COND FALSE !(i == (unsigned char)0) [L101] COND FALSE !(i == (unsigned char)1) [L102] COND FALSE !(i == (unsigned char)2) [L103] COND TRUE i == (unsigned char)3 [L103] r3 = (unsigned char)0 [L105] i = i + (unsigned char)1 [L99] COND FALSE !(i < (unsigned char)4) [L108] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L110] return r; [L121] r = mp_add(a, b) [L16] COND TRUE !(cond) [L17] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.4s, OverallIterations: 19, TraceHistogramMax: 4, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2208 SDtfs, 3275 SDslu, 4320 SDs, 0 SdLazy, 3948 SolverSat, 266 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 234 SyntacticMatches, 28 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2191occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 5349 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 910 NumberOfCodeBlocks, 910 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 835 ConstructedInterpolants, 1 QuantifiedInterpolants, 205610 SizeOfPredicates, 10 NumberOfNonLiveVariables, 686 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 23 InterpolantComputations, 17 PerfectInterpolantSequences, 440/473 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...