/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/aws-c-common/aws_priority_queue_clean_up_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 00:10:13,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 00:10:13,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 00:10:13,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 00:10:13,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 00:10:13,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 00:10:13,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 00:10:13,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 00:10:13,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 00:10:13,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 00:10:13,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 00:10:13,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 00:10:13,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 00:10:13,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 00:10:13,840 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 00:10:13,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 00:10:13,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 00:10:13,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 00:10:13,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 00:10:13,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 00:10:13,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 00:10:13,872 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 00:10:13,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 00:10:13,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 00:10:13,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 00:10:13,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 00:10:13,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 00:10:13,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 00:10:13,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 00:10:13,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 00:10:13,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 00:10:13,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 00:10:13,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 00:10:13,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 00:10:13,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 00:10:13,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 00:10:13,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 00:10:13,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 00:10:13,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 00:10:13,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 00:10:13,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 00:10:13,915 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-07 00:10:13,983 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 00:10:13,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 00:10:13,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 00:10:13,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 00:10:13,988 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 00:10:13,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 00:10:13,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 00:10:13,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 00:10:13,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 00:10:13,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 00:10:13,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 00:10:13,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 00:10:13,991 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 00:10:13,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 00:10:13,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 00:10:13,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 00:10:13,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 00:10:13,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 00:10:13,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 00:10:13,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 00:10:13,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 00:10:13,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 00:10:13,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 00:10:13,993 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 00:10:13,993 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 00:10:13,994 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-07 00:10:14,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 00:10:14,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 00:10:14,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 00:10:14,517 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 00:10:14,518 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 00:10:14,519 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness.i [2021-01-07 00:10:14,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bcbb699a7/51ae3abeea2c40b1b24dff63dcf96834/FLAGe32857624 [2021-01-07 00:10:15,741 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 00:10:15,742 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness.i [2021-01-07 00:10:15,797 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bcbb699a7/51ae3abeea2c40b1b24dff63dcf96834/FLAGe32857624 [2021-01-07 00:10:16,213 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bcbb699a7/51ae3abeea2c40b1b24dff63dcf96834 [2021-01-07 00:10:16,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 00:10:16,220 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 00:10:16,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 00:10:16,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 00:10:16,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 00:10:16,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 12:10:16" (1/1) ... [2021-01-07 00:10:16,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6423513b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:16, skipping insertion in model container [2021-01-07 00:10:16,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 12:10:16" (1/1) ... [2021-01-07 00:10:16,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 00:10:16,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 00:10:16,727 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/aws-c-common/aws_priority_queue_clean_up_harness.i[4501,4514] [2021-01-07 00:10:16,736 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/aws-c-common/aws_priority_queue_clean_up_harness.i[4561,4574] [2021-01-07 00:10:16,766 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-01-07 00:10:16,775 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: IdentifierExpression[~result,] [2021-01-07 00:10:17,891 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy left hand side expression in assignment: lhs: VariableLHS[~allocation~0,] left hand side expression in assignment: lhs: VariableLHS[~alloc_size~1,] left hand side expression in assignment: address: IdentifierExpression[~out_ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] [2021-01-07 00:10:18,018 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:18,019 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:18,019 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:18,020 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:18,021 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~list_a,] left hand side expression in assignment: address: IdentifierExpression[~list_b,] [2021-01-07 00:10:18,033 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:18,034 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:18,036 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:18,037 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~val,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head_reaches_tail~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem348,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem348,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~after,],base],StructAccessExpression[IdentifierExpression[~after,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem359,],base],StructAccessExpression[IdentifierExpression[#t~mem359,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem360,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem360,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],prev],base],StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],prev],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],next],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],next],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: address: IdentifierExpression[~a,] left hand side expression in assignment: address: IdentifierExpression[~b,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem371,],base],StructAccessExpression[IdentifierExpression[#t~mem371,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~before,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~before,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem378,],base],StructAccessExpression[IdentifierExpression[#t~mem378,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem380,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem380,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],StructAccessExpression[IdentifierExpression[~a,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem424,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem424,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~a,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem426,],base],StructAccessExpression[IdentifierExpression[#t~mem426,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],StructAccessExpression[IdentifierExpression[~b,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem427,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem427,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~b,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem428,],base],StructAccessExpression[IdentifierExpression[#t~mem428,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~var,],base],StructAccessExpression[IdentifierExpression[~var,],offset]]] [2021-01-07 00:10:18,445 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-01-07 00:10:18,446 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-01-07 00:10:18,447 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-01-07 00:10:18,448 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-01-07 00:10:18,450 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-01-07 00:10:18,451 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-01-07 00:10:18,452 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-01-07 00:10:18,452 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-01-07 00:10:18,453 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-01-07 00:10:18,454 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cursor,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cursor,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~node~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~curr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem551,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem551,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem554,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem554,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],StructAccessExpression[IdentifierExpression[~str~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~str~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~str~0,],offset]],BinaryExpression[ARITHMOD,IdentifierExpression[~len,],IntegerLiteral[4294967296]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],StructAccessExpression[IdentifierExpression[~storage,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~storage,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tl_last_error~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sp~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~sp~0,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] [2021-01-07 00:10:18,686 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:18,686 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:18,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:10:18,784 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 00:10:18,801 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/aws-c-common/aws_priority_queue_clean_up_harness.i[4501,4514] [2021-01-07 00:10:18,801 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/aws-c-common/aws_priority_queue_clean_up_harness.i[4561,4574] [2021-01-07 00:10:18,804 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-01-07 00:10:18,805 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: IdentifierExpression[~result,] [2021-01-07 00:10:18,840 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy left hand side expression in assignment: lhs: VariableLHS[~allocation~0,] left hand side expression in assignment: lhs: VariableLHS[~alloc_size~1,] left hand side expression in assignment: address: IdentifierExpression[~out_ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] [2021-01-07 00:10:18,859 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:18,860 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:18,860 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:18,861 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:18,861 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~list_a,] left hand side expression in assignment: address: IdentifierExpression[~list_b,] [2021-01-07 00:10:18,870 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:18,871 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:18,872 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:18,872 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~val,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head_reaches_tail~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem362,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem362,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~after,],base],StructAccessExpression[IdentifierExpression[~after,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem373,],base],StructAccessExpression[IdentifierExpression[#t~mem373,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem374,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem374,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem375,],base],StructAccessExpression[IdentifierExpression[#t~mem375,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem376,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem376,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#tmp~1,] left hand side expression in assignment: address: IdentifierExpression[~a,] left hand side expression in assignment: address: IdentifierExpression[~b,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem389,],base],StructAccessExpression[IdentifierExpression[#t~mem389,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~before,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~before,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem396,],base],StructAccessExpression[IdentifierExpression[#t~mem396,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem398,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem398,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],StructAccessExpression[IdentifierExpression[~a,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem442,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem442,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~a,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem444,],base],StructAccessExpression[IdentifierExpression[#t~mem444,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],StructAccessExpression[IdentifierExpression[~b,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem445,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem445,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~b,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem446,],base],StructAccessExpression[IdentifierExpression[#t~mem446,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~var,],base],StructAccessExpression[IdentifierExpression[~var,],offset]]] [2021-01-07 00:10:18,938 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-01-07 00:10:18,939 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-01-07 00:10:18,940 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-01-07 00:10:18,942 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-01-07 00:10:18,944 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-01-07 00:10:18,945 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-01-07 00:10:18,945 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-01-07 00:10:18,946 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-01-07 00:10:18,946 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-01-07 00:10:18,947 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cursor,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cursor,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~node~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~curr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem569,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem569,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem572,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem572,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],StructAccessExpression[IdentifierExpression[~str~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~str~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~str~0,],offset]],BinaryExpression[ARITHMOD,IdentifierExpression[~len,],IntegerLiteral[4294967296]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],StructAccessExpression[IdentifierExpression[~storage,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~storage,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tl_last_error~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sp~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~sp~0,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] [2021-01-07 00:10:19,035 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:19,038 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:19,126 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:10:20,174 INFO L208 MainTranslator]: Completed translation [2021-01-07 00:10:20,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:20 WrapperNode [2021-01-07 00:10:20,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 00:10:20,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 00:10:20,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 00:10:20,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 00:10:20,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:20" (1/1) ... [2021-01-07 00:10:20,294 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:20" (1/1) ... [2021-01-07 00:10:20,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 00:10:20,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 00:10:20,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 00:10:20,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 00:10:20,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:20" (1/1) ... [2021-01-07 00:10:20,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:20" (1/1) ... [2021-01-07 00:10:20,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:20" (1/1) ... [2021-01-07 00:10:20,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:20" (1/1) ... [2021-01-07 00:10:20,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:20" (1/1) ... [2021-01-07 00:10:20,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:20" (1/1) ... [2021-01-07 00:10:20,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:20" (1/1) ... [2021-01-07 00:10:20,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 00:10:20,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 00:10:20,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 00:10:20,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 00:10:20,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:20" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 00:10:20,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 00:10:20,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 00:10:20,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 00:10:20,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 00:10:20,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 00:10:20,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 00:10:20,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 00:10:20,784 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-01-07 00:10:20,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 00:10:20,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 00:10:20,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 00:10:20,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 00:10:31,669 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 00:10:31,670 INFO L299 CfgBuilder]: Removed 160 assume(true) statements. [2021-01-07 00:10:31,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:10:31 BoogieIcfgContainer [2021-01-07 00:10:31,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 00:10:31,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 00:10:31,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 00:10:31,681 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 00:10:31,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 12:10:16" (1/3) ... [2021-01-07 00:10:31,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70cbfc8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 12:10:31, skipping insertion in model container [2021-01-07 00:10:31,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:20" (2/3) ... [2021-01-07 00:10:31,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70cbfc8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 12:10:31, skipping insertion in model container [2021-01-07 00:10:31,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:10:31" (3/3) ... [2021-01-07 00:10:31,688 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_clean_up_harness.i [2021-01-07 00:10:31,697 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 00:10:31,703 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-01-07 00:10:31,724 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-01-07 00:10:31,774 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 00:10:31,774 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 00:10:31,774 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 00:10:31,774 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 00:10:31,775 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 00:10:31,775 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 00:10:31,775 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 00:10:31,775 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 00:10:31,801 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states. [2021-01-07 00:10:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-07 00:10:31,820 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:10:31,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:10:31,821 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:10:31,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:10:31,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1087609144, now seen corresponding path program 1 times [2021-01-07 00:10:31,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:10:31,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460057796] [2021-01-07 00:10:31,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:10:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:10:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:10:32,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460057796] [2021-01-07 00:10:32,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:10:32,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 00:10:32,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037734242] [2021-01-07 00:10:32,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 00:10:32,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:10:32,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 00:10:32,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 00:10:32,758 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 2 states. [2021-01-07 00:10:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:10:32,802 INFO L93 Difference]: Finished difference Result 380 states and 549 transitions. [2021-01-07 00:10:32,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 00:10:32,803 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 45 [2021-01-07 00:10:32,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:10:32,819 INFO L225 Difference]: With dead ends: 380 [2021-01-07 00:10:32,819 INFO L226 Difference]: Without dead ends: 188 [2021-01-07 00:10:32,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 00:10:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-01-07 00:10:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-01-07 00:10:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2021-01-07 00:10:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 245 transitions. [2021-01-07 00:10:32,907 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 245 transitions. Word has length 45 [2021-01-07 00:10:32,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:10:32,907 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 245 transitions. [2021-01-07 00:10:32,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 00:10:32,907 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 245 transitions. [2021-01-07 00:10:32,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-07 00:10:32,916 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:10:32,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:10:32,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 00:10:32,917 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:10:32,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:10:32,920 INFO L82 PathProgramCache]: Analyzing trace with hash 339318222, now seen corresponding path program 1 times [2021-01-07 00:10:32,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:10:32,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531419491] [2021-01-07 00:10:32,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:10:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:10:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:10:33,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531419491] [2021-01-07 00:10:33,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:10:33,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:10:33,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113774071] [2021-01-07 00:10:33,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:10:33,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:10:33,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:10:33,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:10:33,376 INFO L87 Difference]: Start difference. First operand 188 states and 245 transitions. Second operand 4 states. [2021-01-07 00:10:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:10:33,437 INFO L93 Difference]: Finished difference Result 296 states and 385 transitions. [2021-01-07 00:10:33,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:10:33,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2021-01-07 00:10:33,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:10:33,441 INFO L225 Difference]: With dead ends: 296 [2021-01-07 00:10:33,441 INFO L226 Difference]: Without dead ends: 188 [2021-01-07 00:10:33,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:10:33,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-01-07 00:10:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-01-07 00:10:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2021-01-07 00:10:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2021-01-07 00:10:33,458 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 51 [2021-01-07 00:10:33,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:10:33,459 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2021-01-07 00:10:33,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:10:33,459 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2021-01-07 00:10:33,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-07 00:10:33,461 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:10:33,461 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:10:33,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 00:10:33,461 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:10:33,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:10:33,462 INFO L82 PathProgramCache]: Analyzing trace with hash 168473663, now seen corresponding path program 1 times [2021-01-07 00:10:33,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:10:33,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142089757] [2021-01-07 00:10:33,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:10:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:10:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:10:33,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142089757] [2021-01-07 00:10:33,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:10:33,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:10:33,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585352232] [2021-01-07 00:10:33,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:10:33,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:10:33,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:10:33,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:10:33,832 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand 5 states. [2021-01-07 00:10:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:10:34,066 INFO L93 Difference]: Finished difference Result 409 states and 532 transitions. [2021-01-07 00:10:34,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:10:34,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2021-01-07 00:10:34,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:10:34,070 INFO L225 Difference]: With dead ends: 409 [2021-01-07 00:10:34,070 INFO L226 Difference]: Without dead ends: 269 [2021-01-07 00:10:34,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:10:34,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-01-07 00:10:34,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 188. [2021-01-07 00:10:34,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2021-01-07 00:10:34,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 243 transitions. [2021-01-07 00:10:34,089 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 243 transitions. Word has length 55 [2021-01-07 00:10:34,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:10:34,089 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 243 transitions. [2021-01-07 00:10:34,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:10:34,090 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 243 transitions. [2021-01-07 00:10:34,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-07 00:10:34,091 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:10:34,092 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:10:34,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 00:10:34,092 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:10:34,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:10:34,093 INFO L82 PathProgramCache]: Analyzing trace with hash -795727197, now seen corresponding path program 1 times [2021-01-07 00:10:34,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:10:34,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772479199] [2021-01-07 00:10:34,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:10:34,232 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:10:34,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [429295025] [2021-01-07 00:10:34,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:10:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:10:36,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 2554 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 00:10:36,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:10:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:10:36,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772479199] [2021-01-07 00:10:36,273 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:10:36,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429295025] [2021-01-07 00:10:36,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:10:36,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:10:36,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608312209] [2021-01-07 00:10:36,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:10:36,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:10:36,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:10:36,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:10:36,277 INFO L87 Difference]: Start difference. First operand 188 states and 243 transitions. Second operand 6 states. [2021-01-07 00:10:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:10:36,450 INFO L93 Difference]: Finished difference Result 297 states and 384 transitions. [2021-01-07 00:10:36,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 00:10:36,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2021-01-07 00:10:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:10:36,453 INFO L225 Difference]: With dead ends: 297 [2021-01-07 00:10:36,453 INFO L226 Difference]: Without dead ends: 188 [2021-01-07 00:10:36,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:10:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-01-07 00:10:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-01-07 00:10:36,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2021-01-07 00:10:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 242 transitions. [2021-01-07 00:10:36,471 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 242 transitions. Word has length 63 [2021-01-07 00:10:36,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:10:36,472 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 242 transitions. [2021-01-07 00:10:36,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:10:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 242 transitions. [2021-01-07 00:10:36,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-07 00:10:36,474 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:10:36,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:10:36,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:10:36,689 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:10:36,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:10:36,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1514601710, now seen corresponding path program 1 times [2021-01-07 00:10:36,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:10:36,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587004799] [2021-01-07 00:10:36,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:10:36,856 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:10:36,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [811468253] [2021-01-07 00:10:36,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:10:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:10:38,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 2604 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 00:10:38,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:10:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:10:38,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587004799] [2021-01-07 00:10:38,478 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:10:38,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811468253] [2021-01-07 00:10:38,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:10:38,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 00:10:38,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524337178] [2021-01-07 00:10:38,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 00:10:38,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:10:38,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 00:10:38,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:10:38,481 INFO L87 Difference]: Start difference. First operand 188 states and 242 transitions. Second operand 7 states. [2021-01-07 00:10:38,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:10:38,832 INFO L93 Difference]: Finished difference Result 384 states and 496 transitions. [2021-01-07 00:10:38,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 00:10:38,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2021-01-07 00:10:38,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:10:38,835 INFO L225 Difference]: With dead ends: 384 [2021-01-07 00:10:38,836 INFO L226 Difference]: Without dead ends: 259 [2021-01-07 00:10:38,837 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-01-07 00:10:38,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-01-07 00:10:38,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 188. [2021-01-07 00:10:38,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2021-01-07 00:10:38,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 241 transitions. [2021-01-07 00:10:38,851 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 241 transitions. Word has length 75 [2021-01-07 00:10:38,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:10:38,852 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 241 transitions. [2021-01-07 00:10:38,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 00:10:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 241 transitions. [2021-01-07 00:10:38,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-07 00:10:38,853 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:10:38,854 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:10:39,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:10:39,067 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:10:39,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:10:39,068 INFO L82 PathProgramCache]: Analyzing trace with hash 328015662, now seen corresponding path program 1 times [2021-01-07 00:10:39,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:10:39,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106063009] [2021-01-07 00:10:39,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:10:39,248 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:10:39,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150711642] [2021-01-07 00:10:39,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:10:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:10:40,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 2699 conjuncts, 18 conjunts are in the unsatisfiable core [2021-01-07 00:10:40,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:10:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:10:40,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106063009] [2021-01-07 00:10:40,735 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:10:40,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150711642] [2021-01-07 00:10:40,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:10:40,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 00:10:40,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816206739] [2021-01-07 00:10:40,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 00:10:40,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:10:40,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 00:10:40,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:10:40,738 INFO L87 Difference]: Start difference. First operand 188 states and 241 transitions. Second operand 7 states. [2021-01-07 00:10:41,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:10:41,336 INFO L93 Difference]: Finished difference Result 428 states and 547 transitions. [2021-01-07 00:10:41,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-07 00:10:41,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2021-01-07 00:10:41,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:10:41,345 INFO L225 Difference]: With dead ends: 428 [2021-01-07 00:10:41,345 INFO L226 Difference]: Without dead ends: 324 [2021-01-07 00:10:41,346 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-01-07 00:10:41,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-01-07 00:10:41,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 193. [2021-01-07 00:10:41,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2021-01-07 00:10:41,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 245 transitions. [2021-01-07 00:10:41,363 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 245 transitions. Word has length 83 [2021-01-07 00:10:41,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:10:41,369 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 245 transitions. [2021-01-07 00:10:41,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 00:10:41,370 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 245 transitions. [2021-01-07 00:10:41,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-07 00:10:41,373 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:10:41,374 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:10:41,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:10:41,589 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:10:41,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:10:41,590 INFO L82 PathProgramCache]: Analyzing trace with hash 329624376, now seen corresponding path program 1 times [2021-01-07 00:10:41,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:10:41,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660208848] [2021-01-07 00:10:41,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:10:41,707 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:10:41,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1053483877] [2021-01-07 00:10:41,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:10:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:10:43,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 2702 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-07 00:10:43,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:10:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:10:43,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660208848] [2021-01-07 00:10:43,200 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:10:43,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053483877] [2021-01-07 00:10:43,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:10:43,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:10:43,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701823653] [2021-01-07 00:10:43,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:10:43,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:10:43,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:10:43,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:10:43,203 INFO L87 Difference]: Start difference. First operand 193 states and 245 transitions. Second operand 4 states. [2021-01-07 00:10:43,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:10:43,324 INFO L93 Difference]: Finished difference Result 270 states and 340 transitions. [2021-01-07 00:10:43,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:10:43,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2021-01-07 00:10:43,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:10:43,327 INFO L225 Difference]: With dead ends: 270 [2021-01-07 00:10:43,327 INFO L226 Difference]: Without dead ends: 198 [2021-01-07 00:10:43,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:10:43,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-01-07 00:10:43,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 193. [2021-01-07 00:10:43,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2021-01-07 00:10:43,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 243 transitions. [2021-01-07 00:10:43,343 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 243 transitions. Word has length 83 [2021-01-07 00:10:43,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:10:43,344 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 243 transitions. [2021-01-07 00:10:43,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:10:43,344 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 243 transitions. [2021-01-07 00:10:43,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-07 00:10:43,345 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:10:43,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:10:43,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:10:43,559 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:10:43,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:10:43,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1669729280, now seen corresponding path program 1 times [2021-01-07 00:10:43,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:10:43,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539916420] [2021-01-07 00:10:43,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:10:43,740 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:10:43,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [957158037] [2021-01-07 00:10:43,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:10:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:10:45,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 2709 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-07 00:10:45,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:10:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:10:45,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539916420] [2021-01-07 00:10:45,288 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:10:45,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957158037] [2021-01-07 00:10:45,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:10:45,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 00:10:45,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242817607] [2021-01-07 00:10:45,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 00:10:45,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:10:45,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 00:10:45,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-07 00:10:45,290 INFO L87 Difference]: Start difference. First operand 193 states and 243 transitions. Second operand 8 states. [2021-01-07 00:10:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:10:45,911 INFO L93 Difference]: Finished difference Result 440 states and 553 transitions. [2021-01-07 00:10:45,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 00:10:45,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2021-01-07 00:10:45,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:10:45,914 INFO L225 Difference]: With dead ends: 440 [2021-01-07 00:10:45,914 INFO L226 Difference]: Without dead ends: 325 [2021-01-07 00:10:45,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-01-07 00:10:45,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-01-07 00:10:45,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 199. [2021-01-07 00:10:45,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2021-01-07 00:10:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 251 transitions. [2021-01-07 00:10:45,933 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 251 transitions. Word has length 84 [2021-01-07 00:10:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:10:45,933 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 251 transitions. [2021-01-07 00:10:45,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 00:10:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 251 transitions. [2021-01-07 00:10:45,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-07 00:10:45,935 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:10:45,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:10:46,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:10:46,150 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:10:46,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:10:46,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1253430718, now seen corresponding path program 1 times [2021-01-07 00:10:46,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:10:46,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152242173] [2021-01-07 00:10:46,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:10:46,297 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:10:46,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [867812996] [2021-01-07 00:10:46,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:10:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:10:47,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 2714 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 00:10:47,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:10:47,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:10:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:10:47,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152242173] [2021-01-07 00:10:47,744 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:10:47,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867812996] [2021-01-07 00:10:47,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:10:47,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 00:10:47,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407104956] [2021-01-07 00:10:47,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:10:47,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:10:47,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:10:47,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:10:47,747 INFO L87 Difference]: Start difference. First operand 199 states and 251 transitions. Second operand 6 states. [2021-01-07 00:10:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:10:54,982 INFO L93 Difference]: Finished difference Result 456 states and 578 transitions. [2021-01-07 00:10:54,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 00:10:54,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2021-01-07 00:10:54,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:10:54,985 INFO L225 Difference]: With dead ends: 456 [2021-01-07 00:10:54,985 INFO L226 Difference]: Without dead ends: 332 [2021-01-07 00:10:54,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:10:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-01-07 00:10:55,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 203. [2021-01-07 00:10:55,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2021-01-07 00:10:55,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 256 transitions. [2021-01-07 00:10:55,004 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 256 transitions. Word has length 84 [2021-01-07 00:10:55,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:10:55,004 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 256 transitions. [2021-01-07 00:10:55,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:10:55,004 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 256 transitions. [2021-01-07 00:10:55,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-07 00:10:55,005 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:10:55,006 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:10:55,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:10:55,220 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:10:55,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:10:55,221 INFO L82 PathProgramCache]: Analyzing trace with hash 2012177280, now seen corresponding path program 1 times [2021-01-07 00:10:55,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:10:55,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133922753] [2021-01-07 00:10:55,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:10:55,357 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:10:55,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [6061162] [2021-01-07 00:10:55,357 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:10:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:10:56,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 2711 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 00:10:56,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:10:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:10:56,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133922753] [2021-01-07 00:10:56,727 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:10:56,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6061162] [2021-01-07 00:10:56,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:10:56,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:10:56,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430831908] [2021-01-07 00:10:56,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:10:56,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:10:56,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:10:56,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:10:56,730 INFO L87 Difference]: Start difference. First operand 203 states and 256 transitions. Second operand 4 states. [2021-01-07 00:10:56,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:10:56,801 INFO L93 Difference]: Finished difference Result 335 states and 422 transitions. [2021-01-07 00:10:56,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:10:56,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2021-01-07 00:10:56,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:10:56,804 INFO L225 Difference]: With dead ends: 335 [2021-01-07 00:10:56,804 INFO L226 Difference]: Without dead ends: 211 [2021-01-07 00:10:56,805 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:10:56,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-01-07 00:10:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2021-01-07 00:10:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2021-01-07 00:10:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 260 transitions. [2021-01-07 00:10:56,821 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 260 transitions. Word has length 84 [2021-01-07 00:10:56,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:10:56,821 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 260 transitions. [2021-01-07 00:10:56,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:10:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 260 transitions. [2021-01-07 00:10:56,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-07 00:10:56,822 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:10:56,823 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:10:57,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 00:10:57,037 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:10:57,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:10:57,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1617810494, now seen corresponding path program 1 times [2021-01-07 00:10:57,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:10:57,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479201065] [2021-01-07 00:10:57,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:10:57,165 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:10:57,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [288041975] [2021-01-07 00:10:57,166 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:10:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:10:58,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 2706 conjuncts, 22 conjunts are in the unsatisfiable core [2021-01-07 00:10:58,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:10:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:10:58,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479201065] [2021-01-07 00:10:58,806 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:10:58,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288041975] [2021-01-07 00:10:58,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:10:58,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 00:10:58,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766563249] [2021-01-07 00:10:58,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 00:10:58,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:10:58,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 00:10:58,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-07 00:10:58,808 INFO L87 Difference]: Start difference. First operand 207 states and 260 transitions. Second operand 8 states. [2021-01-07 00:10:59,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:10:59,780 INFO L93 Difference]: Finished difference Result 352 states and 435 transitions. [2021-01-07 00:10:59,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 00:10:59,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2021-01-07 00:10:59,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:10:59,783 INFO L225 Difference]: With dead ends: 352 [2021-01-07 00:10:59,783 INFO L226 Difference]: Without dead ends: 264 [2021-01-07 00:10:59,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-01-07 00:10:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-01-07 00:10:59,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 207. [2021-01-07 00:10:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2021-01-07 00:10:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 258 transitions. [2021-01-07 00:10:59,803 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 258 transitions. Word has length 84 [2021-01-07 00:10:59,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:10:59,804 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 258 transitions. [2021-01-07 00:10:59,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 00:10:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 258 transitions. [2021-01-07 00:10:59,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-07 00:10:59,805 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:10:59,805 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:11:00,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-01-07 00:11:00,021 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:00,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1230261128, now seen corresponding path program 1 times [2021-01-07 00:11:00,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:00,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054404636] [2021-01-07 00:11:00,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:00,143 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:00,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [264906263] [2021-01-07 00:11:00,151 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:01,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 2703 conjuncts, 40 conjunts are in the unsatisfiable core [2021-01-07 00:11:01,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:01,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:11:01,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054404636] [2021-01-07 00:11:01,919 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:01,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264906263] [2021-01-07 00:11:01,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:01,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 00:11:01,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117960989] [2021-01-07 00:11:01,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 00:11:01,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:01,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 00:11:01,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:11:01,921 INFO L87 Difference]: Start difference. First operand 207 states and 258 transitions. Second operand 9 states. [2021-01-07 00:11:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:05,384 INFO L93 Difference]: Finished difference Result 624 states and 774 transitions. [2021-01-07 00:11:05,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 00:11:05,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2021-01-07 00:11:05,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:05,389 INFO L225 Difference]: With dead ends: 624 [2021-01-07 00:11:05,390 INFO L226 Difference]: Without dead ends: 494 [2021-01-07 00:11:05,391 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-01-07 00:11:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-01-07 00:11:05,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 222. [2021-01-07 00:11:05,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2021-01-07 00:11:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 277 transitions. [2021-01-07 00:11:05,414 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 277 transitions. Word has length 84 [2021-01-07 00:11:05,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:05,415 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 277 transitions. [2021-01-07 00:11:05,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 00:11:05,415 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 277 transitions. [2021-01-07 00:11:05,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-07 00:11:05,416 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:05,416 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:11:05,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:05,629 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:05,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:05,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1392833590, now seen corresponding path program 1 times [2021-01-07 00:11:05,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:05,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649439577] [2021-01-07 00:11:05,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:05,760 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:05,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025618150] [2021-01-07 00:11:05,761 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:07,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 2708 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 00:11:07,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:07,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:11:07,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649439577] [2021-01-07 00:11:07,224 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:07,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025618150] [2021-01-07 00:11:07,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:07,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:11:07,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884251769] [2021-01-07 00:11:07,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:11:07,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:07,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:11:07,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:11:07,227 INFO L87 Difference]: Start difference. First operand 222 states and 277 transitions. Second operand 4 states. [2021-01-07 00:11:07,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:07,313 INFO L93 Difference]: Finished difference Result 348 states and 433 transitions. [2021-01-07 00:11:07,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:11:07,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2021-01-07 00:11:07,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:07,316 INFO L225 Difference]: With dead ends: 348 [2021-01-07 00:11:07,316 INFO L226 Difference]: Without dead ends: 218 [2021-01-07 00:11:07,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:11:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-01-07 00:11:07,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214. [2021-01-07 00:11:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2021-01-07 00:11:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 265 transitions. [2021-01-07 00:11:07,338 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 265 transitions. Word has length 84 [2021-01-07 00:11:07,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:07,338 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 265 transitions. [2021-01-07 00:11:07,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:11:07,338 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 265 transitions. [2021-01-07 00:11:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-07 00:11:07,340 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:07,340 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:11:07,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:07,554 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:07,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:07,555 INFO L82 PathProgramCache]: Analyzing trace with hash 877172746, now seen corresponding path program 1 times [2021-01-07 00:11:07,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:07,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859472320] [2021-01-07 00:11:07,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:07,671 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:07,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [471256374] [2021-01-07 00:11:07,672 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:08,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 2698 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 00:11:08,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:11:08,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859472320] [2021-01-07 00:11:08,968 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:08,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471256374] [2021-01-07 00:11:08,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:08,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:11:08,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275707742] [2021-01-07 00:11:08,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:11:08,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:08,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:11:08,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:11:08,970 INFO L87 Difference]: Start difference. First operand 214 states and 265 transitions. Second operand 4 states. [2021-01-07 00:11:09,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:09,199 INFO L93 Difference]: Finished difference Result 396 states and 494 transitions. [2021-01-07 00:11:09,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:11:09,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2021-01-07 00:11:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:09,203 INFO L225 Difference]: With dead ends: 396 [2021-01-07 00:11:09,203 INFO L226 Difference]: Without dead ends: 229 [2021-01-07 00:11:09,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:11:09,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-01-07 00:11:09,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 220. [2021-01-07 00:11:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2021-01-07 00:11:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 270 transitions. [2021-01-07 00:11:09,220 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 270 transitions. Word has length 84 [2021-01-07 00:11:09,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:09,221 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 270 transitions. [2021-01-07 00:11:09,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:11:09,221 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 270 transitions. [2021-01-07 00:11:09,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-07 00:11:09,222 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:09,222 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:11:09,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 00:11:09,437 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:09,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:09,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1654312400, now seen corresponding path program 1 times [2021-01-07 00:11:09,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:09,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312374593] [2021-01-07 00:11:09,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:09,543 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:09,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [885721766] [2021-01-07 00:11:09,543 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:10,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 2703 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-07 00:11:10,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:11:11,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312374593] [2021-01-07 00:11:11,142 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:11,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885721766] [2021-01-07 00:11:11,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:11,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:11:11,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878623876] [2021-01-07 00:11:11,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:11:11,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:11,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:11:11,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:11:11,144 INFO L87 Difference]: Start difference. First operand 220 states and 270 transitions. Second operand 5 states. [2021-01-07 00:11:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:16,319 INFO L93 Difference]: Finished difference Result 499 states and 612 transitions. [2021-01-07 00:11:16,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 00:11:16,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2021-01-07 00:11:16,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:16,324 INFO L225 Difference]: With dead ends: 499 [2021-01-07 00:11:16,324 INFO L226 Difference]: Without dead ends: 327 [2021-01-07 00:11:16,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:11:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-01-07 00:11:16,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 223. [2021-01-07 00:11:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2021-01-07 00:11:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 272 transitions. [2021-01-07 00:11:16,344 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 272 transitions. Word has length 86 [2021-01-07 00:11:16,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:16,344 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 272 transitions. [2021-01-07 00:11:16,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:11:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 272 transitions. [2021-01-07 00:11:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-07 00:11:16,346 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:16,346 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:11:16,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-07 00:11:16,560 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:16,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:16,561 INFO L82 PathProgramCache]: Analyzing trace with hash 273960302, now seen corresponding path program 1 times [2021-01-07 00:11:16,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:16,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648127895] [2021-01-07 00:11:16,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:16,661 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:16,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1344523195] [2021-01-07 00:11:16,662 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:19,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 2708 conjuncts, 90 conjunts are in the unsatisfiable core [2021-01-07 00:11:19,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:19,493 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 00:11:19,494 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:19,509 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:19,511 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:11:19,511 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 00:11:19,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:11:19,812 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2021-01-07 00:11:19,814 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:19,843 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:19,845 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:11:19,845 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:26 [2021-01-07 00:11:19,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:11:19,919 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-01-07 00:11:19,920 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:19,941 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:19,942 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:11:19,942 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2021-01-07 00:11:20,060 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:20,061 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 00:11:20,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:11:20,067 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:20,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:20,090 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:11:20,090 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2021-01-07 00:11:20,153 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-07 00:11:20,157 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:20,187 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:20,198 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-01-07 00:11:20,198 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:29 [2021-01-07 00:11:22,917 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-07 00:11:22,920 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:22,950 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:22,954 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-01-07 00:11:22,954 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:25 [2021-01-07 00:11:23,110 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2021-01-07 00:11:23,117 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:23,122 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:23,122 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:11:23,123 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:1 [2021-01-07 00:11:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:11:23,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648127895] [2021-01-07 00:11:23,247 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:23,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344523195] [2021-01-07 00:11:23,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:23,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-01-07 00:11:23,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639662985] [2021-01-07 00:11:23,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-07 00:11:23,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:23,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-07 00:11:23,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=169, Unknown=1, NotChecked=0, Total=210 [2021-01-07 00:11:23,250 INFO L87 Difference]: Start difference. First operand 223 states and 272 transitions. Second operand 15 states. [2021-01-07 00:11:36,678 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2021-01-07 00:11:36,922 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2021-01-07 00:11:37,252 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2021-01-07 00:11:39,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:39,423 INFO L93 Difference]: Finished difference Result 645 states and 785 transitions. [2021-01-07 00:11:39,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-07 00:11:39,425 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2021-01-07 00:11:39,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:39,428 INFO L225 Difference]: With dead ends: 645 [2021-01-07 00:11:39,428 INFO L226 Difference]: Without dead ends: 486 [2021-01-07 00:11:39,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=120, Invalid=479, Unknown=1, NotChecked=0, Total=600 [2021-01-07 00:11:39,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-01-07 00:11:39,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 263. [2021-01-07 00:11:39,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2021-01-07 00:11:39,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 320 transitions. [2021-01-07 00:11:39,458 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 320 transitions. Word has length 86 [2021-01-07 00:11:39,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:39,459 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 320 transitions. [2021-01-07 00:11:39,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-07 00:11:39,459 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 320 transitions. [2021-01-07 00:11:39,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-07 00:11:39,461 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:39,461 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:11:39,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-07 00:11:39,676 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:39,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:39,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2037509238, now seen corresponding path program 1 times [2021-01-07 00:11:39,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:39,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092845637] [2021-01-07 00:11:39,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:39,814 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:39,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1941662348] [2021-01-07 00:11:39,814 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true