/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_2-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 01:35:51,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 01:35:51,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 01:35:51,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 01:35:51,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 01:35:51,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 01:35:51,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 01:35:51,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 01:35:51,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 01:35:51,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 01:35:51,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 01:35:51,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 01:35:51,853 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 01:35:51,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 01:35:51,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 01:35:51,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 01:35:51,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 01:35:51,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 01:35:51,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 01:35:51,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 01:35:51,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 01:35:51,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 01:35:51,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 01:35:51,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 01:35:51,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 01:35:51,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 01:35:51,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 01:35:51,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 01:35:51,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 01:35:51,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 01:35:51,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 01:35:51,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 01:35:51,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 01:35:51,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 01:35:51,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 01:35:51,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 01:35:51,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 01:35:51,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 01:35:51,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 01:35:51,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 01:35:51,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 01:35:51,925 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 01:35:51,952 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 01:35:51,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 01:35:51,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 01:35:51,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 01:35:51,955 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 01:35:51,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 01:35:51,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 01:35:51,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 01:35:51,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 01:35:51,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 01:35:51,957 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 01:35:51,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 01:35:51,957 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 01:35:51,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 01:35:51,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 01:35:51,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 01:35:51,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 01:35:51,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:35:51,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 01:35:51,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 01:35:51,959 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 01:35:51,959 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 01:35:51,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 01:35:51,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 01:35:51,960 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 01:35:51,960 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 [2020-12-23 01:35:52,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 01:35:52,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 01:35:52,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 01:35:52,416 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 01:35:52,417 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 01:35:52,418 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2020-12-23 01:35:52,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/521db15e3/dfbe57e7e63d481d8f783a80eb99c63d/FLAGc738f5dfa [2020-12-23 01:35:53,220 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 01:35:53,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2020-12-23 01:35:53,234 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/521db15e3/dfbe57e7e63d481d8f783a80eb99c63d/FLAGc738f5dfa [2020-12-23 01:35:53,547 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/521db15e3/dfbe57e7e63d481d8f783a80eb99c63d [2020-12-23 01:35:53,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 01:35:53,554 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 01:35:53,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 01:35:53,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 01:35:53,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 01:35:53,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:35:53" (1/1) ... [2020-12-23 01:35:53,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a65d01b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:35:53, skipping insertion in model container [2020-12-23 01:35:53,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:35:53" (1/1) ... [2020-12-23 01:35:53,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 01:35:53,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 01:35:53,798 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_2-2.i[863,876] 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,] [2020-12-23 01:35:53,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:35:53,891 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 01:35:53,906 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_2-2.i[863,876] 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,] [2020-12-23 01:35:53,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:35:53,961 INFO L208 MainTranslator]: Completed translation [2020-12-23 01:35:53,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:35:53 WrapperNode [2020-12-23 01:35:53,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 01:35:53,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 01:35:53,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 01:35:53,964 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 01:35:53,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:35:53" (1/1) ... [2020-12-23 01:35:53,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:35:53" (1/1) ... [2020-12-23 01:35:54,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 01:35:54,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 01:35:54,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 01:35:54,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 01:35:54,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:35:53" (1/1) ... [2020-12-23 01:35:54,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:35:53" (1/1) ... [2020-12-23 01:35:54,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:35:53" (1/1) ... [2020-12-23 01:35:54,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:35:53" (1/1) ... [2020-12-23 01:35:54,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:35:53" (1/1) ... [2020-12-23 01:35:54,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:35:53" (1/1) ... [2020-12-23 01:35:54,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:35:53" (1/1) ... [2020-12-23 01:35:54,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 01:35:54,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 01:35:54,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 01:35:54,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 01:35:54,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:35:53" (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 [2020-12-23 01:35:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 01:35:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 01:35:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 01:35:54,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 01:35:55,210 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 01:35:55,210 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-23 01:35:55,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:35:55 BoogieIcfgContainer [2020-12-23 01:35:55,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 01:35:55,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 01:35:55,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 01:35:55,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 01:35:55,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:35:53" (1/3) ... [2020-12-23 01:35:55,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c2f141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:35:55, skipping insertion in model container [2020-12-23 01:35:55,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:35:53" (2/3) ... [2020-12-23 01:35:55,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c2f141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:35:55, skipping insertion in model container [2020-12-23 01:35:55,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:35:55" (3/3) ... [2020-12-23 01:35:55,232 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2020-12-23 01:35:55,240 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 01:35:55,250 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 01:35:55,274 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 01:35:55,321 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 01:35:55,321 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 01:35:55,322 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 01:35:55,322 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 01:35:55,322 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 01:35:55,322 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 01:35:55,322 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 01:35:55,322 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 01:35:55,345 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2020-12-23 01:35:55,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-23 01:35:55,353 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:35:55,354 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:35:55,355 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:35:55,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:35:55,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1979526715, now seen corresponding path program 1 times [2020-12-23 01:35:55,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:35:55,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110558963] [2020-12-23 01:35:55,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:35:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:35:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:35:55,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110558963] [2020-12-23 01:35:55,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:35:55,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 01:35:55,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939074677] [2020-12-23 01:35:55,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 01:35:55,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:35:55,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 01:35:55,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 01:35:55,634 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2020-12-23 01:35:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:35:55,673 INFO L93 Difference]: Finished difference Result 92 states and 160 transitions. [2020-12-23 01:35:55,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 01:35:55,676 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2020-12-23 01:35:55,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:35:55,703 INFO L225 Difference]: With dead ends: 92 [2020-12-23 01:35:55,703 INFO L226 Difference]: Without dead ends: 47 [2020-12-23 01:35:55,707 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 [2020-12-23 01:35:55,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-12-23 01:35:55,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-12-23 01:35:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-12-23 01:35:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2020-12-23 01:35:55,755 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 13 [2020-12-23 01:35:55,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:35:55,756 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 78 transitions. [2020-12-23 01:35:55,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 01:35:55,756 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2020-12-23 01:35:55,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-23 01:35:55,757 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:35:55,757 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:35:55,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 01:35:55,758 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:35:55,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:35:55,759 INFO L82 PathProgramCache]: Analyzing trace with hash 726479629, now seen corresponding path program 1 times [2020-12-23 01:35:55,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:35:55,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56013194] [2020-12-23 01:35:55,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:35:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:35:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:35:56,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56013194] [2020-12-23 01:35:56,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:35:56,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:35:56,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614165366] [2020-12-23 01:35:56,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:35:56,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:35:56,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:35:56,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:35:56,032 INFO L87 Difference]: Start difference. First operand 47 states and 78 transitions. Second operand 3 states. [2020-12-23 01:35:56,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:35:56,227 INFO L93 Difference]: Finished difference Result 112 states and 190 transitions. [2020-12-23 01:35:56,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:35:56,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-12-23 01:35:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:35:56,230 INFO L225 Difference]: With dead ends: 112 [2020-12-23 01:35:56,230 INFO L226 Difference]: Without dead ends: 75 [2020-12-23 01:35:56,232 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 [2020-12-23 01:35:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-12-23 01:35:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2020-12-23 01:35:56,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-12-23 01:35:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2020-12-23 01:35:56,260 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 13 [2020-12-23 01:35:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:35:56,261 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2020-12-23 01:35:56,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:35:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2020-12-23 01:35:56,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-23 01:35:56,264 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:35:56,264 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:35:56,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 01:35:56,266 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:35:56,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:35:56,268 INFO L82 PathProgramCache]: Analyzing trace with hash 727939832, now seen corresponding path program 1 times [2020-12-23 01:35:56,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:35:56,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038242176] [2020-12-23 01:35:56,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:35:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:35:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:35:56,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038242176] [2020-12-23 01:35:56,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:35:56,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:35:56,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279652969] [2020-12-23 01:35:56,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:35:56,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:35:56,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:35:56,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:35:56,525 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. Second operand 4 states. [2020-12-23 01:35:56,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:35:56,883 INFO L93 Difference]: Finished difference Result 184 states and 301 transitions. [2020-12-23 01:35:56,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:35:56,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-12-23 01:35:56,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:35:56,886 INFO L225 Difference]: With dead ends: 184 [2020-12-23 01:35:56,886 INFO L226 Difference]: Without dead ends: 147 [2020-12-23 01:35:56,887 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 [2020-12-23 01:35:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-12-23 01:35:56,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 101. [2020-12-23 01:35:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-12-23 01:35:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2020-12-23 01:35:56,899 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 19 [2020-12-23 01:35:56,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:35:56,899 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2020-12-23 01:35:56,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:35:56,900 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2020-12-23 01:35:56,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 01:35:56,901 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:35:56,901 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] [2020-12-23 01:35:56,902 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 01:35:56,902 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:35:56,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:35:56,903 INFO L82 PathProgramCache]: Analyzing trace with hash -302552601, now seen corresponding path program 1 times [2020-12-23 01:35:56,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:35:56,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636193235] [2020-12-23 01:35:56,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:35:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:35:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-23 01:35:57,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636193235] [2020-12-23 01:35:57,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:35:57,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:35:57,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90537668] [2020-12-23 01:35:57,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:35:57,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:35:57,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:35:57,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:35:57,035 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand 4 states. [2020-12-23 01:35:57,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:35:57,249 INFO L93 Difference]: Finished difference Result 302 states and 441 transitions. [2020-12-23 01:35:57,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:35:57,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-12-23 01:35:57,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:35:57,252 INFO L225 Difference]: With dead ends: 302 [2020-12-23 01:35:57,252 INFO L226 Difference]: Without dead ends: 214 [2020-12-23 01:35:57,253 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 [2020-12-23 01:35:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-12-23 01:35:57,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 108. [2020-12-23 01:35:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-12-23 01:35:57,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2020-12-23 01:35:57,265 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 25 [2020-12-23 01:35:57,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:35:57,265 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2020-12-23 01:35:57,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:35:57,265 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2020-12-23 01:35:57,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-23 01:35:57,267 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:35:57,267 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] [2020-12-23 01:35:57,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 01:35:57,267 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:35:57,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:35:57,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1128243813, now seen corresponding path program 1 times [2020-12-23 01:35:57,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:35:57,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988319708] [2020-12-23 01:35:57,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:35:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:35:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-23 01:35:57,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988319708] [2020-12-23 01:35:57,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:35:57,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:35:57,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811368829] [2020-12-23 01:35:57,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:35:57,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:35:57,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:35:57,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:35:57,383 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand 4 states. [2020-12-23 01:35:57,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:35:57,585 INFO L93 Difference]: Finished difference Result 308 states and 447 transitions. [2020-12-23 01:35:57,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:35:57,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-12-23 01:35:57,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:35:57,588 INFO L225 Difference]: With dead ends: 308 [2020-12-23 01:35:57,589 INFO L226 Difference]: Without dead ends: 220 [2020-12-23 01:35:57,593 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 [2020-12-23 01:35:57,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-12-23 01:35:57,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 119. [2020-12-23 01:35:57,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-12-23 01:35:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2020-12-23 01:35:57,621 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 26 [2020-12-23 01:35:57,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:35:57,622 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2020-12-23 01:35:57,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:35:57,623 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2020-12-23 01:35:57,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 01:35:57,627 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:35:57,627 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] [2020-12-23 01:35:57,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 01:35:57,628 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:35:57,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:35:57,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1070765944, now seen corresponding path program 1 times [2020-12-23 01:35:57,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:35:57,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776646273] [2020-12-23 01:35:57,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:35:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:35:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-23 01:35:57,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776646273] [2020-12-23 01:35:57,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:35:57,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:35:57,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558067178] [2020-12-23 01:35:57,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:35:57,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:35:57,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:35:57,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:35:57,780 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand 3 states. [2020-12-23 01:35:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:35:57,788 INFO L93 Difference]: Finished difference Result 205 states and 299 transitions. [2020-12-23 01:35:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:35:57,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-23 01:35:57,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:35:57,789 INFO L225 Difference]: With dead ends: 205 [2020-12-23 01:35:57,790 INFO L226 Difference]: Without dead ends: 106 [2020-12-23 01:35:57,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:35:57,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-12-23 01:35:57,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-12-23 01:35:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-12-23 01:35:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2020-12-23 01:35:57,816 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 27 [2020-12-23 01:35:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:35:57,816 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2020-12-23 01:35:57,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:35:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2020-12-23 01:35:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-23 01:35:57,818 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:35:57,818 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:35:57,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 01:35:57,818 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:35:57,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:35:57,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1640046083, now seen corresponding path program 1 times [2020-12-23 01:35:57,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:35:57,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58286121] [2020-12-23 01:35:57,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:35:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:35:57,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 01:35:57,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58286121] [2020-12-23 01:35:57,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:35:57,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:35:57,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656017535] [2020-12-23 01:35:57,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:35:57,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:35:57,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:35:57,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:35:57,936 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand 4 states. [2020-12-23 01:35:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:35:58,306 INFO L93 Difference]: Finished difference Result 300 states and 448 transitions. [2020-12-23 01:35:58,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:35:58,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-12-23 01:35:58,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:35:58,308 INFO L225 Difference]: With dead ends: 300 [2020-12-23 01:35:58,308 INFO L226 Difference]: Without dead ends: 214 [2020-12-23 01:35:58,309 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 [2020-12-23 01:35:58,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-12-23 01:35:58,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 149. [2020-12-23 01:35:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-12-23 01:35:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 218 transitions. [2020-12-23 01:35:58,317 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 218 transitions. Word has length 33 [2020-12-23 01:35:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:35:58,318 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 218 transitions. [2020-12-23 01:35:58,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:35:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 218 transitions. [2020-12-23 01:35:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 01:35:58,319 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:35:58,320 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:35:58,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 01:35:58,320 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:35:58,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:35:58,321 INFO L82 PathProgramCache]: Analyzing trace with hash -84755096, now seen corresponding path program 1 times [2020-12-23 01:35:58,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:35:58,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770330523] [2020-12-23 01:35:58,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:35:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:35:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 01:35:58,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770330523] [2020-12-23 01:35:58,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206559305] [2020-12-23 01:35:58,525 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 [2020-12-23 01:35:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:35:58,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 01:35:58,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:35:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 01:35:58,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:35:58,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2020-12-23 01:35:58,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402378465] [2020-12-23 01:35:58,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:35:58,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:35:58,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:35:58,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-23 01:35:58,770 INFO L87 Difference]: Start difference. First operand 149 states and 218 transitions. Second operand 4 states. [2020-12-23 01:35:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:35:59,033 INFO L93 Difference]: Finished difference Result 338 states and 516 transitions. [2020-12-23 01:35:59,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:35:59,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-12-23 01:35:59,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:35:59,038 INFO L225 Difference]: With dead ends: 338 [2020-12-23 01:35:59,039 INFO L226 Difference]: Without dead ends: 209 [2020-12-23 01:35:59,042 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-23 01:35:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-12-23 01:35:59,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 190. [2020-12-23 01:35:59,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-12-23 01:35:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 267 transitions. [2020-12-23 01:35:59,059 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 267 transitions. Word has length 39 [2020-12-23 01:35:59,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:35:59,060 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 267 transitions. [2020-12-23 01:35:59,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:35:59,060 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 267 transitions. [2020-12-23 01:35:59,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 01:35:59,069 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:35:59,069 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] [2020-12-23 01:35:59,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-12-23 01:35:59,285 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:35:59,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:35:59,287 INFO L82 PathProgramCache]: Analyzing trace with hash 790077655, now seen corresponding path program 1 times [2020-12-23 01:35:59,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:35:59,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369097060] [2020-12-23 01:35:59,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:35:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:35:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 01:35:59,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369097060] [2020-12-23 01:35:59,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242689084] [2020-12-23 01:35:59,463 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 [2020-12-23 01:35:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:35:59,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 01:35:59,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:35:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-23 01:35:59,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:35:59,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2020-12-23 01:35:59,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34677529] [2020-12-23 01:35:59,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:35:59,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:35:59,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:35:59,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:35:59,709 INFO L87 Difference]: Start difference. First operand 190 states and 267 transitions. Second operand 5 states. [2020-12-23 01:35:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:35:59,852 INFO L93 Difference]: Finished difference Result 395 states and 559 transitions. [2020-12-23 01:35:59,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:35:59,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2020-12-23 01:35:59,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:35:59,854 INFO L225 Difference]: With dead ends: 395 [2020-12-23 01:35:59,854 INFO L226 Difference]: Without dead ends: 205 [2020-12-23 01:35:59,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-23 01:35:59,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-12-23 01:35:59,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 180. [2020-12-23 01:35:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-12-23 01:35:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 242 transitions. [2020-12-23 01:35:59,867 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 242 transitions. Word has length 45 [2020-12-23 01:35:59,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:35:59,868 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 242 transitions. [2020-12-23 01:35:59,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:35:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 242 transitions. [2020-12-23 01:35:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 01:35:59,870 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:35:59,871 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2020-12-23 01:36:00,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:36:00,089 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:36:00,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:36:00,091 INFO L82 PathProgramCache]: Analyzing trace with hash -975887029, now seen corresponding path program 1 times [2020-12-23 01:36:00,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:36:00,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700462248] [2020-12-23 01:36:00,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:36:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:36:00,351 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:36:00,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700462248] [2020-12-23 01:36:00,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:36:00,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:36:00,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079952841] [2020-12-23 01:36:00,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:36:00,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:36:00,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:36:00,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:36:00,354 INFO L87 Difference]: Start difference. First operand 180 states and 242 transitions. Second operand 5 states. [2020-12-23 01:36:00,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:36:00,756 INFO L93 Difference]: Finished difference Result 717 states and 958 transitions. [2020-12-23 01:36:00,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 01:36:00,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2020-12-23 01:36:00,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:36:00,760 INFO L225 Difference]: With dead ends: 717 [2020-12-23 01:36:00,760 INFO L226 Difference]: Without dead ends: 553 [2020-12-23 01:36:00,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:36:00,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-12-23 01:36:00,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 180. [2020-12-23 01:36:00,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-12-23 01:36:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 242 transitions. [2020-12-23 01:36:00,772 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 242 transitions. Word has length 66 [2020-12-23 01:36:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:36:00,773 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 242 transitions. [2020-12-23 01:36:00,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:36:00,773 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 242 transitions. [2020-12-23 01:36:00,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-23 01:36:00,774 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:36:00,774 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1] [2020-12-23 01:36:00,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 01:36:00,775 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:36:00,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:36:00,775 INFO L82 PathProgramCache]: Analyzing trace with hash -42691454, now seen corresponding path program 1 times [2020-12-23 01:36:00,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:36:00,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319527770] [2020-12-23 01:36:00,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:36:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:36:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:36:00,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319527770] [2020-12-23 01:36:00,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:36:00,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 01:36:00,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493990632] [2020-12-23 01:36:00,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 01:36:00,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:36:00,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 01:36:00,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:36:00,966 INFO L87 Difference]: Start difference. First operand 180 states and 242 transitions. Second operand 7 states. [2020-12-23 01:36:01,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:36:01,744 INFO L93 Difference]: Finished difference Result 925 states and 1228 transitions. [2020-12-23 01:36:01,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 01:36:01,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2020-12-23 01:36:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:36:01,749 INFO L225 Difference]: With dead ends: 925 [2020-12-23 01:36:01,749 INFO L226 Difference]: Without dead ends: 761 [2020-12-23 01:36:01,750 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-23 01:36:01,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2020-12-23 01:36:01,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 175. [2020-12-23 01:36:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-12-23 01:36:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 236 transitions. [2020-12-23 01:36:01,761 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 236 transitions. Word has length 67 [2020-12-23 01:36:01,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:36:01,762 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 236 transitions. [2020-12-23 01:36:01,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 01:36:01,762 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 236 transitions. [2020-12-23 01:36:01,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-23 01:36:01,763 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:36:01,763 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2020-12-23 01:36:01,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 01:36:01,764 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:36:01,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:36:01,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2082079527, now seen corresponding path program 1 times [2020-12-23 01:36:01,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:36:01,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649093246] [2020-12-23 01:36:01,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:36:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:36:01,997 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-12-23 01:36:01,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649093246] [2020-12-23 01:36:01,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640208657] [2020-12-23 01:36:01,998 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 [2020-12-23 01:36:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:36:03,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 01:36:03,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:36:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-12-23 01:36:03,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:36:03,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-12-23 01:36:03,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206392738] [2020-12-23 01:36:03,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 01:36:03,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:36:03,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 01:36:03,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-23 01:36:03,149 INFO L87 Difference]: Start difference. First operand 175 states and 236 transitions. Second operand 8 states. [2020-12-23 01:36:03,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:36:03,371 INFO L93 Difference]: Finished difference Result 575 states and 775 transitions. [2020-12-23 01:36:03,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 01:36:03,371 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-12-23 01:36:03,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:36:03,379 INFO L225 Difference]: With dead ends: 575 [2020-12-23 01:36:03,379 INFO L226 Difference]: Without dead ends: 395 [2020-12-23 01:36:03,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 01:36:03,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2020-12-23 01:36:03,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 341. [2020-12-23 01:36:03,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-12-23 01:36:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 453 transitions. [2020-12-23 01:36:03,413 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 453 transitions. Word has length 69 [2020-12-23 01:36:03,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:36:03,413 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 453 transitions. [2020-12-23 01:36:03,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 01:36:03,413 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 453 transitions. [2020-12-23 01:36:03,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-23 01:36:03,414 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:36:03,415 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2020-12-23 01:36:03,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-23 01:36:03,616 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:36:03,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:36:03,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1390014551, now seen corresponding path program 1 times [2020-12-23 01:36:03,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:36:03,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241652909] [2020-12-23 01:36:03,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:36:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:36:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-12-23 01:36:03,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241652909] [2020-12-23 01:36:03,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048737003] [2020-12-23 01:36:03,817 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 [2020-12-23 01:36:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:36:05,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-23 01:36:05,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:36:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-12-23 01:36:05,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:36:05,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2020-12-23 01:36:05,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929922543] [2020-12-23 01:36:05,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 01:36:05,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:36:05,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 01:36:05,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-12-23 01:36:05,340 INFO L87 Difference]: Start difference. First operand 341 states and 453 transitions. Second operand 9 states. [2020-12-23 01:36:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:36:05,944 INFO L93 Difference]: Finished difference Result 1005 states and 1339 transitions. [2020-12-23 01:36:05,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 01:36:05,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2020-12-23 01:36:05,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:36:05,949 INFO L225 Difference]: With dead ends: 1005 [2020-12-23 01:36:05,949 INFO L226 Difference]: Without dead ends: 666 [2020-12-23 01:36:05,950 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-12-23 01:36:05,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2020-12-23 01:36:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 558. [2020-12-23 01:36:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2020-12-23 01:36:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 730 transitions. [2020-12-23 01:36:05,972 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 730 transitions. Word has length 70 [2020-12-23 01:36:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:36:05,973 INFO L481 AbstractCegarLoop]: Abstraction has 558 states and 730 transitions. [2020-12-23 01:36:05,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 01:36:05,973 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 730 transitions. [2020-12-23 01:36:05,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-23 01:36:05,974 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:36:05,975 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2020-12-23 01:36:06,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:36:06,179 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:36:06,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:36:06,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1036981234, now seen corresponding path program 1 times [2020-12-23 01:36:06,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:36:06,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67672124] [2020-12-23 01:36:06,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:36:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:36:06,330 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:36:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:36:06,461 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:36:06,499 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 01:36:06,499 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 01:36:06,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 01:36:06,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:36:06 BoogieIcfgContainer [2020-12-23 01:36:06,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 01:36:06,571 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 01:36:06,571 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 01:36:06,571 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 01:36:06,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:35:55" (3/4) ... [2020-12-23 01:36:06,576 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-23 01:36:06,576 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 01:36:06,578 INFO L168 Benchmark]: Toolchain (without parser) took 13025.03 ms. Allocated memory was 152.0 MB in the beginning and 257.9 MB in the end (delta: 105.9 MB). Free memory was 128.0 MB in the beginning and 204.8 MB in the end (delta: -76.7 MB). Peak memory consumption was 30.2 MB. Max. memory is 8.0 GB. [2020-12-23 01:36:06,579 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 152.0 MB. Free memory is still 124.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:36:06,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.42 ms. Allocated memory is still 152.0 MB. Free memory was 127.8 MB in the beginning and 115.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2020-12-23 01:36:06,580 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.68 ms. Allocated memory is still 152.0 MB. Free memory was 115.7 MB in the beginning and 105.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-12-23 01:36:06,581 INFO L168 Benchmark]: Boogie Preprocessor took 137.88 ms. Allocated memory is still 152.0 MB. Free memory was 105.6 MB in the beginning and 128.9 MB in the end (delta: -23.3 MB). Peak memory consumption was 10.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:36:06,582 INFO L168 Benchmark]: RCFGBuilder took 989.71 ms. Allocated memory is still 152.0 MB. Free memory was 128.9 MB in the beginning and 89.4 MB in the end (delta: 39.5 MB). Peak memory consumption was 42.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:36:06,582 INFO L168 Benchmark]: TraceAbstraction took 11352.12 ms. Allocated memory was 152.0 MB in the beginning and 257.9 MB in the end (delta: 105.9 MB). Free memory was 88.9 MB in the beginning and 204.8 MB in the end (delta: -115.9 MB). Peak memory consumption was 112.2 MB. Max. memory is 8.0 GB. [2020-12-23 01:36:06,583 INFO L168 Benchmark]: Witness Printer took 5.47 ms. Allocated memory is still 257.9 MB. Free memory is still 204.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:36:06,587 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.20 ms. Allocated memory is still 152.0 MB. Free memory is still 124.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 407.42 ms. Allocated memory is still 152.0 MB. Free memory was 127.8 MB in the beginning and 115.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 120.68 ms. Allocated memory is still 152.0 MB. Free memory was 115.7 MB in the beginning and 105.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 137.88 ms. Allocated memory is still 152.0 MB. Free memory was 105.6 MB in the beginning and 128.9 MB in the end (delta: -23.3 MB). Peak memory consumption was 10.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 989.71 ms. Allocated memory is still 152.0 MB. Free memory was 128.9 MB in the beginning and 89.4 MB in the end (delta: 39.5 MB). Peak memory consumption was 42.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 11352.12 ms. Allocated memory was 152.0 MB in the beginning and 257.9 MB in the end (delta: 105.9 MB). Free memory was 88.9 MB in the beginning and 204.8 MB in the end (delta: -115.9 MB). Peak memory consumption was 112.2 MB. Max. memory is 8.0 GB. * Witness Printer took 5.47 ms. Allocated memory is still 257.9 MB. Free memory is still 204.8 MB. 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; [L117] a = __VERIFIER_nondet_uint() [L119] b = 234770789 [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 FALSE !(b3 == (unsigned char)0) [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)255)) [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 TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L73] partial_sum = carry [L74] carry = (unsigned short)0 [L75] COND FALSE !(i < na) [L81] COND TRUE i < nb [L82] COND FALSE !(i == (unsigned char)0) [L83] COND TRUE i == (unsigned char)1 [L83] partial_sum = partial_sum + b1 [L84] COND FALSE !(i == (unsigned char)2) [L85] COND FALSE !(i == (unsigned char)3) [L87] COND FALSE !(partial_sum > ((unsigned char)255)) [L91] COND FALSE !(i == (unsigned char)0) [L92] COND TRUE i == (unsigned char)1 [L92] r1 = (unsigned char)partial_sum [L93] COND FALSE !(i == (unsigned char)2) [L94] COND FALSE !(i == (unsigned char)3) [L96] i = i + (unsigned char)1 [L72] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L73] partial_sum = carry [L74] carry = (unsigned short)0 [L75] COND FALSE !(i < na) [L81] COND TRUE i < nb [L82] COND FALSE !(i == (unsigned char)0) [L83] COND FALSE !(i == (unsigned char)1) [L84] COND TRUE i == (unsigned char)2 [L84] partial_sum = partial_sum + b2 [L85] COND FALSE !(i == (unsigned char)3) [L87] COND FALSE !(partial_sum > ((unsigned char)255)) [L91] COND FALSE !(i == (unsigned char)0) [L92] COND FALSE !(i == (unsigned char)1) [L93] COND TRUE i == (unsigned char)2 [L93] r2 = (unsigned char)partial_sum [L94] COND FALSE !(i == (unsigned char)3) [L96] i = i + (unsigned char)1 [L72] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L73] partial_sum = carry [L74] carry = (unsigned short)0 [L75] COND FALSE !(i < na) [L81] COND TRUE i < nb [L82] COND FALSE !(i == (unsigned char)0) [L83] COND FALSE !(i == (unsigned char)1) [L84] COND FALSE !(i == (unsigned char)2) [L85] COND TRUE i == (unsigned char)3 [L85] partial_sum = partial_sum + b3 [L87] COND FALSE !(partial_sum > ((unsigned char)255)) [L91] COND FALSE !(i == (unsigned char)0) [L92] COND FALSE !(i == (unsigned char)1) [L93] COND FALSE !(i == (unsigned char)2) [L94] COND TRUE i == (unsigned char)3 [L94] r3 = (unsigned char)partial_sum [L96] i = i + (unsigned char)1 [L72] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) [L99] COND FALSE !(i < (unsigned char)4) [L108] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) VAL [r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U)=101] [L110] return r; VAL [r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U)=101] [L121] r = mp_add(a, b) [L16] COND TRUE !(cond) VAL [r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U)=101] [L17] reach_error() VAL [r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U)=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.1s, OverallIterations: 14, TraceHistogramMax: 4, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1075 SDtfs, 1971 SDslu, 1779 SDs, 0 SdLazy, 1947 SolverSat, 210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 238 SyntacticMatches, 22 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=558occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 1485 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 806 NumberOfCodeBlocks, 806 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 718 ConstructedInterpolants, 0 QuantifiedInterpolants, 165709 SizeOfPredicates, 13 NumberOfNonLiveVariables, 652 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 565/581 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...