/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/uthash-2.0.2/uthash_FNV_test10-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 04:12:35,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 04:12:35,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 04:12:35,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 04:12:35,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 04:12:35,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 04:12:35,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 04:12:35,868 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 04:12:35,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 04:12:35,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 04:12:35,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 04:12:35,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 04:12:35,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 04:12:35,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 04:12:35,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 04:12:35,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 04:12:35,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 04:12:35,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 04:12:35,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 04:12:35,888 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 04:12:35,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 04:12:35,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 04:12:35,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 04:12:35,895 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 04:12:35,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 04:12:35,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 04:12:35,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 04:12:35,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 04:12:35,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 04:12:35,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 04:12:35,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 04:12:35,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 04:12:35,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 04:12:35,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 04:12:35,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 04:12:35,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 04:12:35,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 04:12:35,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 04:12:35,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 04:12:35,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 04:12:35,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 04:12:35,938 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 04:12:35,966 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 04:12:35,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 04:12:35,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 04:12:35,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 04:12:35,969 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 04:12:35,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 04:12:35,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 04:12:35,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 04:12:35,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 04:12:35,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 04:12:35,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 04:12:35,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 04:12:35,972 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 04:12:35,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 04:12:35,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 04:12:35,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 04:12:35,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 04:12:35,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 04:12:35,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 04:12:35,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 04:12:35,974 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 04:12:35,974 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 04:12:35,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 04:12:35,975 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 04:12:35,975 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 04:12:35,975 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 04:12:36,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 04:12:36,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 04:12:36,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 04:12:36,512 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 04:12:36,513 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 04:12:36,514 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i [2021-01-07 04:12:36,620 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6a1449b3d/e4f7c0ac97c14b3599ecff2a746754fc/FLAG4b8a30522 [2021-01-07 04:12:37,604 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 04:12:37,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i [2021-01-07 04:12:37,642 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6a1449b3d/e4f7c0ac97c14b3599ecff2a746754fc/FLAG4b8a30522 [2021-01-07 04:12:38,144 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6a1449b3d/e4f7c0ac97c14b3599ecff2a746754fc [2021-01-07 04:12:38,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 04:12:38,151 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 04:12:38,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 04:12:38,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 04:12:38,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 04:12:38,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:12:38" (1/1) ... [2021-01-07 04:12:38,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67859a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:12:38, skipping insertion in model container [2021-01-07 04:12:38,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:12:38" (1/1) ... [2021-01-07 04:12:38,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 04:12:38,267 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 04:12:38,851 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/uthash-2.0.2/uthash_FNV_test10-3.i[33022,33035] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem81,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem81,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem91,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem91,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem117,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem117,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem125,],base],StructAccessExpression[IdentifierExpression[#t~mem125,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem126,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem126,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem136,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem136,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem165,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem165,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem166,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem166,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem167,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem167,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem168,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem168,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem184,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem184,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem185,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem185,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem197,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem197,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem209,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem209,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem219,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem219,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem245,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem245,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem253,],base],StructAccessExpression[IdentifierExpression[#t~mem253,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem254,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem254,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem264,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem264,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~usertmp~0,] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem449,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem449,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem454,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem454,],offset],IdentifierExpression[#t~mem456,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem460,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem460,],offset],IdentifierExpression[#t~mem462,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~0,],base],StructAccessExpression[IdentifierExpression[~_hd_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem474,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem474,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem477,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem477,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem490,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem490,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem495,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem495,],offset],IdentifierExpression[#t~mem497,]]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem501,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem501,],offset],IdentifierExpression[#t~mem503,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem515,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem515,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem518,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem518,],offset]]]] [2021-01-07 04:12:39,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:12:39,271 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 04:12:39,329 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/uthash-2.0.2/uthash_FNV_test10-3.i[33022,33035] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem44,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem44,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem45,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem45,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem46,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem46,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem47,],base],StructAccessExpression[IdentifierExpression[#t~mem47,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem49,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem49,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem62,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem62,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem63,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem63,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem75,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem75,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem89,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem89,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem99,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem99,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem126,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem126,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem134,],base],StructAccessExpression[IdentifierExpression[#t~mem134,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem136,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem136,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem146,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem146,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem175,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem175,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem176,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem176,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem177,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem177,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem178,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem178,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem179,],base],StructAccessExpression[IdentifierExpression[#t~mem179,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem181,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem181,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem194,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem194,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem195,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem195,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem207,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem207,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem221,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem221,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem231,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem231,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem258,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem258,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem266,],base],StructAccessExpression[IdentifierExpression[#t~mem266,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem268,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem268,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem278,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem278,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~usertmp~0,] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem467,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem467,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem472,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem472,],offset],IdentifierExpression[#t~mem474,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem478,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem478,],offset],IdentifierExpression[#t~mem480,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~0,],base],StructAccessExpression[IdentifierExpression[~_hd_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem492,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem492,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem495,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem495,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem508,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem508,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem513,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem513,],offset],IdentifierExpression[#t~mem515,]]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem519,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem519,],offset],IdentifierExpression[#t~mem521,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem533,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem533,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem536,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem536,],offset]]]] [2021-01-07 04:12:39,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:12:39,630 INFO L208 MainTranslator]: Completed translation [2021-01-07 04:12:39,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:12:39 WrapperNode [2021-01-07 04:12:39,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 04:12:39,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 04:12:39,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 04:12:39,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 04:12:39,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:12:39" (1/1) ... [2021-01-07 04:12:39,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:12:39" (1/1) ... [2021-01-07 04:12:39,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 04:12:39,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 04:12:39,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 04:12:39,919 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 04:12:39,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:12:39" (1/1) ... [2021-01-07 04:12:39,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:12:39" (1/1) ... [2021-01-07 04:12:39,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:12:39" (1/1) ... [2021-01-07 04:12:39,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:12:39" (1/1) ... [2021-01-07 04:12:40,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:12:39" (1/1) ... [2021-01-07 04:12:40,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:12:39" (1/1) ... [2021-01-07 04:12:40,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:12:39" (1/1) ... [2021-01-07 04:12:40,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 04:12:40,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 04:12:40,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 04:12:40,173 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 04:12:40,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:12:39" (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 04:12:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 04:12:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 04:12:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 04:12:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 04:12:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 04:12:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-01-07 04:12:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 04:12:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 04:12:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 04:12:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 04:12:40,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 04:12:44,008 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 04:12:44,009 INFO L299 CfgBuilder]: Removed 224 assume(true) statements. [2021-01-07 04:12:44,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:12:44 BoogieIcfgContainer [2021-01-07 04:12:44,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 04:12:44,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 04:12:44,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 04:12:44,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 04:12:44,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 04:12:38" (1/3) ... [2021-01-07 04:12:44,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dd7ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:12:44, skipping insertion in model container [2021-01-07 04:12:44,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:12:39" (2/3) ... [2021-01-07 04:12:44,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dd7ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:12:44, skipping insertion in model container [2021-01-07 04:12:44,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:12:44" (3/3) ... [2021-01-07 04:12:44,021 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test10-3.i [2021-01-07 04:12:44,029 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 04:12:44,035 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2021-01-07 04:12:44,058 INFO L253 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-01-07 04:12:44,091 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 04:12:44,091 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 04:12:44,091 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 04:12:44,092 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 04:12:44,092 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 04:12:44,092 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 04:12:44,092 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 04:12:44,092 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 04:12:44,122 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states. [2021-01-07 04:12:44,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-07 04:12:44,129 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:12:44,130 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:12:44,130 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:12:44,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:12:44,137 INFO L82 PathProgramCache]: Analyzing trace with hash -128377380, now seen corresponding path program 1 times [2021-01-07 04:12:44,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:12:44,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658659373] [2021-01-07 04:12:44,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:12:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:12:44,359 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 04:12:44,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658659373] [2021-01-07 04:12:44,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:12:44,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:12:44,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968666898] [2021-01-07 04:12:44,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 04:12:44,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:12:44,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 04:12:44,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:12:44,402 INFO L87 Difference]: Start difference. First operand 520 states. Second operand 2 states. [2021-01-07 04:12:44,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:12:44,516 INFO L93 Difference]: Finished difference Result 1038 states and 1752 transitions. [2021-01-07 04:12:44,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 04:12:44,518 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2021-01-07 04:12:44,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:12:44,550 INFO L225 Difference]: With dead ends: 1038 [2021-01-07 04:12:44,550 INFO L226 Difference]: Without dead ends: 465 [2021-01-07 04:12:44,561 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 04:12:44,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-01-07 04:12:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2021-01-07 04:12:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2021-01-07 04:12:44,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 608 transitions. [2021-01-07 04:12:44,680 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 608 transitions. Word has length 9 [2021-01-07 04:12:44,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:12:44,681 INFO L481 AbstractCegarLoop]: Abstraction has 465 states and 608 transitions. [2021-01-07 04:12:44,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 04:12:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 608 transitions. [2021-01-07 04:12:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 04:12:44,686 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:12:44,686 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] [2021-01-07 04:12:44,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 04:12:44,689 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:12:44,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:12:44,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1568739198, now seen corresponding path program 1 times [2021-01-07 04:12:44,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:12:44,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778234445] [2021-01-07 04:12:44,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:12:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:12:44,846 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 04:12:44,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778234445] [2021-01-07 04:12:44,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:12:44,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:12:44,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485396994] [2021-01-07 04:12:44,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:12:44,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:12:44,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:12:44,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:12:44,853 INFO L87 Difference]: Start difference. First operand 465 states and 608 transitions. Second operand 4 states. [2021-01-07 04:12:45,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:12:45,721 INFO L93 Difference]: Finished difference Result 831 states and 1087 transitions. [2021-01-07 04:12:45,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:12:45,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2021-01-07 04:12:45,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:12:45,726 INFO L225 Difference]: With dead ends: 831 [2021-01-07 04:12:45,726 INFO L226 Difference]: Without dead ends: 540 [2021-01-07 04:12:45,727 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 04:12:45,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-01-07 04:12:45,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 467. [2021-01-07 04:12:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2021-01-07 04:12:45,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 610 transitions. [2021-01-07 04:12:45,743 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 610 transitions. Word has length 44 [2021-01-07 04:12:45,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:12:45,743 INFO L481 AbstractCegarLoop]: Abstraction has 467 states and 610 transitions. [2021-01-07 04:12:45,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:12:45,777 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 610 transitions. [2021-01-07 04:12:45,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-07 04:12:45,787 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:12:45,788 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:45,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 04:12:45,788 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:12:45,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:12:45,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1325558428, now seen corresponding path program 1 times [2021-01-07 04:12:45,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:12:45,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941420336] [2021-01-07 04:12:45,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:12:45,866 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:12:45,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1922714736] [2021-01-07 04:12:45,867 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 04:12:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:12:46,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:12:46,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:12:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:12:46,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941420336] [2021-01-07 04:12:46,500 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:12:46,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922714736] [2021-01-07 04:12:46,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:12:46,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:12:46,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314133764] [2021-01-07 04:12:46,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:12:46,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:12:46,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:12:46,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:12:46,503 INFO L87 Difference]: Start difference. First operand 467 states and 610 transitions. Second operand 3 states. [2021-01-07 04:12:46,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:12:46,609 INFO L93 Difference]: Finished difference Result 951 states and 1247 transitions. [2021-01-07 04:12:46,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:12:46,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2021-01-07 04:12:46,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:12:46,612 INFO L225 Difference]: With dead ends: 951 [2021-01-07 04:12:46,613 INFO L226 Difference]: Without dead ends: 488 [2021-01-07 04:12:46,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:12:46,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-01-07 04:12:46,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 487. [2021-01-07 04:12:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2021-01-07 04:12:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 630 transitions. [2021-01-07 04:12:46,629 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 630 transitions. Word has length 97 [2021-01-07 04:12:46,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:12:46,629 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 630 transitions. [2021-01-07 04:12:46,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:12:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 630 transitions. [2021-01-07 04:12:46,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-07 04:12:46,632 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:12:46,632 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:46,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-07 04:12:46,847 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:12:46,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:12:46,849 INFO L82 PathProgramCache]: Analyzing trace with hash 948433376, now seen corresponding path program 1 times [2021-01-07 04:12:46,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:12:46,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348002254] [2021-01-07 04:12:46,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:12:46,908 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:12:46,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [926691545] [2021-01-07 04:12:46,909 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 04:12:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:12:47,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:12:47,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:12:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 04:12:47,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348002254] [2021-01-07 04:12:47,485 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:12:47,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926691545] [2021-01-07 04:12:47,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:12:47,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:12:47,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503295943] [2021-01-07 04:12:47,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:12:47,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:12:47,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:12:47,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:12:47,488 INFO L87 Difference]: Start difference. First operand 487 states and 630 transitions. Second operand 3 states. [2021-01-07 04:12:47,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:12:47,584 INFO L93 Difference]: Finished difference Result 787 states and 1024 transitions. [2021-01-07 04:12:47,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:12:47,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2021-01-07 04:12:47,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:12:47,588 INFO L225 Difference]: With dead ends: 787 [2021-01-07 04:12:47,588 INFO L226 Difference]: Without dead ends: 508 [2021-01-07 04:12:47,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:12:47,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-01-07 04:12:47,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 507. [2021-01-07 04:12:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2021-01-07 04:12:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 650 transitions. [2021-01-07 04:12:47,602 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 650 transitions. Word has length 97 [2021-01-07 04:12:47,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:12:47,603 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 650 transitions. [2021-01-07 04:12:47,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:12:47,603 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 650 transitions. [2021-01-07 04:12:47,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-07 04:12:47,605 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:12:47,605 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:47,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:12:47,820 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:12:47,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:12:47,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1352389214, now seen corresponding path program 1 times [2021-01-07 04:12:47,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:12:47,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893652463] [2021-01-07 04:12:47,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:12:47,851 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:12:47,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [626342312] [2021-01-07 04:12:47,852 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 04:12:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:12:48,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:12:48,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:12:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:12:48,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893652463] [2021-01-07 04:12:48,413 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:12:48,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626342312] [2021-01-07 04:12:48,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:12:48,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:12:48,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912324821] [2021-01-07 04:12:48,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:12:48,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:12:48,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:12:48,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:12:48,416 INFO L87 Difference]: Start difference. First operand 507 states and 650 transitions. Second operand 4 states. [2021-01-07 04:12:48,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:12:48,551 INFO L93 Difference]: Finished difference Result 1086 states and 1400 transitions. [2021-01-07 04:12:48,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:12:48,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2021-01-07 04:12:48,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:12:48,557 INFO L225 Difference]: With dead ends: 1086 [2021-01-07 04:12:48,557 INFO L226 Difference]: Without dead ends: 583 [2021-01-07 04:12:48,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 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 04:12:48,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-01-07 04:12:48,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 493. [2021-01-07 04:12:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2021-01-07 04:12:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 629 transitions. [2021-01-07 04:12:48,579 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 629 transitions. Word has length 97 [2021-01-07 04:12:48,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:12:48,579 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 629 transitions. [2021-01-07 04:12:48,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:12:48,580 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 629 transitions. [2021-01-07 04:12:48,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-07 04:12:48,588 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:12:48,589 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:48,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:12:48,803 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:12:48,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:12:48,804 INFO L82 PathProgramCache]: Analyzing trace with hash 881478960, now seen corresponding path program 1 times [2021-01-07 04:12:48,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:12:48,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362129128] [2021-01-07 04:12:48,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:12:48,852 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:12:48,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1972968048] [2021-01-07 04:12:48,857 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 04:12:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:12:49,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:12:49,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:12:49,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 04:12:49,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362129128] [2021-01-07 04:12:49,331 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:12:49,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972968048] [2021-01-07 04:12:49,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:12:49,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:12:49,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897184813] [2021-01-07 04:12:49,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:12:49,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:12:49,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:12:49,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:12:49,343 INFO L87 Difference]: Start difference. First operand 493 states and 629 transitions. Second operand 4 states. [2021-01-07 04:12:49,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:12:49,451 INFO L93 Difference]: Finished difference Result 761 states and 972 transitions. [2021-01-07 04:12:49,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:12:49,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2021-01-07 04:12:49,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:12:49,456 INFO L225 Difference]: With dead ends: 761 [2021-01-07 04:12:49,457 INFO L226 Difference]: Without dead ends: 480 [2021-01-07 04:12:49,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 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 04:12:49,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-01-07 04:12:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 479. [2021-01-07 04:12:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2021-01-07 04:12:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 608 transitions. [2021-01-07 04:12:49,476 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 608 transitions. Word has length 97 [2021-01-07 04:12:49,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:12:49,479 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 608 transitions. [2021-01-07 04:12:49,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:12:49,479 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 608 transitions. [2021-01-07 04:12:49,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-07 04:12:49,480 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:12:49,482 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:49,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:12:49,697 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:12:49,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:12:49,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1427704734, now seen corresponding path program 1 times [2021-01-07 04:12:49,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:12:49,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917743009] [2021-01-07 04:12:49,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:12:49,722 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:12:49,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [471280246] [2021-01-07 04:12:49,722 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 04:12:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:12:50,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:12:50,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:12:50,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:12:50,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917743009] [2021-01-07 04:12:50,261 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:12:50,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471280246] [2021-01-07 04:12:50,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:12:50,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:12:50,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259895998] [2021-01-07 04:12:50,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:12:50,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:12:50,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:12:50,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:12:50,263 INFO L87 Difference]: Start difference. First operand 479 states and 608 transitions. Second operand 3 states. [2021-01-07 04:12:50,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:12:50,389 INFO L93 Difference]: Finished difference Result 1231 states and 1562 transitions. [2021-01-07 04:12:50,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:12:50,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2021-01-07 04:12:50,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:12:50,394 INFO L225 Difference]: With dead ends: 1231 [2021-01-07 04:12:50,394 INFO L226 Difference]: Without dead ends: 756 [2021-01-07 04:12:50,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:12:50,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2021-01-07 04:12:50,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 721. [2021-01-07 04:12:50,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2021-01-07 04:12:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 930 transitions. [2021-01-07 04:12:50,419 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 930 transitions. Word has length 97 [2021-01-07 04:12:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:12:50,420 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 930 transitions. [2021-01-07 04:12:50,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:12:50,420 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 930 transitions. [2021-01-07 04:12:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-01-07 04:12:50,422 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:12:50,422 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:50,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-07 04:12:50,638 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:12:50,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:12:50,638 INFO L82 PathProgramCache]: Analyzing trace with hash -371205377, now seen corresponding path program 1 times [2021-01-07 04:12:50,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:12:50,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677264915] [2021-01-07 04:12:50,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:12:50,660 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:12:50,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112474159] [2021-01-07 04:12:50,660 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 04:12:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:12:51,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:12:51,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:12:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:12:51,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677264915] [2021-01-07 04:12:51,192 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:12:51,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112474159] [2021-01-07 04:12:51,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:12:51,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:12:51,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336653235] [2021-01-07 04:12:51,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:12:51,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:12:51,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:12:51,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:12:51,194 INFO L87 Difference]: Start difference. First operand 721 states and 930 transitions. Second operand 3 states. [2021-01-07 04:12:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:12:51,259 INFO L93 Difference]: Finished difference Result 1400 states and 1809 transitions. [2021-01-07 04:12:51,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:12:51,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2021-01-07 04:12:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:12:51,264 INFO L225 Difference]: With dead ends: 1400 [2021-01-07 04:12:51,265 INFO L226 Difference]: Without dead ends: 727 [2021-01-07 04:12:51,266 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:12:51,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2021-01-07 04:12:51,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2021-01-07 04:12:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2021-01-07 04:12:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 936 transitions. [2021-01-07 04:12:51,291 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 936 transitions. Word has length 104 [2021-01-07 04:12:51,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:12:51,292 INFO L481 AbstractCegarLoop]: Abstraction has 727 states and 936 transitions. [2021-01-07 04:12:51,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:12:51,292 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 936 transitions. [2021-01-07 04:12:51,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:12:51,293 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:12:51,294 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:51,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:12:51,509 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:12:51,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:12:51,511 INFO L82 PathProgramCache]: Analyzing trace with hash -2085853600, now seen corresponding path program 1 times [2021-01-07 04:12:51,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:12:51,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918186164] [2021-01-07 04:12:51,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:12:51,534 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:12:51,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723991059] [2021-01-07 04:12:51,535 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 04:12:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:12:51,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 04:12:51,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:12:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 04:12:52,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918186164] [2021-01-07 04:12:52,026 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:12:52,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723991059] [2021-01-07 04:12:52,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:12:52,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2021-01-07 04:12:52,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658927027] [2021-01-07 04:12:52,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:12:52,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:12:52,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:12:52,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:12:52,029 INFO L87 Difference]: Start difference. First operand 727 states and 936 transitions. Second operand 4 states. [2021-01-07 04:12:52,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:12:52,121 INFO L93 Difference]: Finished difference Result 1411 states and 1820 transitions. [2021-01-07 04:12:52,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:12:52,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2021-01-07 04:12:52,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:12:52,126 INFO L225 Difference]: With dead ends: 1411 [2021-01-07 04:12:52,126 INFO L226 Difference]: Without dead ends: 733 [2021-01-07 04:12:52,127 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 103 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 04:12:52,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2021-01-07 04:12:52,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2021-01-07 04:12:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2021-01-07 04:12:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 942 transitions. [2021-01-07 04:12:52,149 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 942 transitions. Word has length 106 [2021-01-07 04:12:52,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:12:52,149 INFO L481 AbstractCegarLoop]: Abstraction has 733 states and 942 transitions. [2021-01-07 04:12:52,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:12:52,149 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 942 transitions. [2021-01-07 04:12:52,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-01-07 04:12:52,151 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:12:52,151 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:52,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:12:52,365 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:12:52,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:12:52,366 INFO L82 PathProgramCache]: Analyzing trace with hash -462744993, now seen corresponding path program 2 times [2021-01-07 04:12:52,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:12:52,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712176782] [2021-01-07 04:12:52,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:12:52,386 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:12:52,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [467363292] [2021-01-07 04:12:52,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 04:12:52,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:12:52,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:12:52,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:12:52,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:12:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 04:12:53,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712176782] [2021-01-07 04:12:53,045 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:12:53,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467363292] [2021-01-07 04:12:53,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:12:53,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2021-01-07 04:12:53,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621500194] [2021-01-07 04:12:53,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:12:53,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:12:53,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:12:53,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:12:53,048 INFO L87 Difference]: Start difference. First operand 733 states and 942 transitions. Second operand 5 states. [2021-01-07 04:12:53,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:12:53,162 INFO L93 Difference]: Finished difference Result 1422 states and 1831 transitions. [2021-01-07 04:12:53,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:12:53,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2021-01-07 04:12:53,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:12:53,167 INFO L225 Difference]: With dead ends: 1422 [2021-01-07 04:12:53,167 INFO L226 Difference]: Without dead ends: 739 [2021-01-07 04:12:53,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:12:53,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2021-01-07 04:12:53,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2021-01-07 04:12:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2021-01-07 04:12:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 948 transitions. [2021-01-07 04:12:53,194 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 948 transitions. Word has length 108 [2021-01-07 04:12:53,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:12:53,194 INFO L481 AbstractCegarLoop]: Abstraction has 739 states and 948 transitions. [2021-01-07 04:12:53,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:12:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 948 transitions. [2021-01-07 04:12:53,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-01-07 04:12:53,196 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:12:53,196 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:53,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 04:12:53,412 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:12:53,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:12:53,413 INFO L82 PathProgramCache]: Analyzing trace with hash 87417216, now seen corresponding path program 3 times [2021-01-07 04:12:53,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:12:53,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569910115] [2021-01-07 04:12:53,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:12:53,437 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:12:53,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [948535444] [2021-01-07 04:12:53,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 04:12:53,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 04:12:53,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:12:53,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 04:12:53,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:12:53,947 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-01-07 04:12:53,948 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:12:53,954 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:12:53,955 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:12:53,955 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2021-01-07 04:12:54,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:12:54,017 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 15 treesize of output 7 [2021-01-07 04:12:54,019 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:12:54,024 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:12:54,026 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:12:54,026 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:71, output treesize:3 [2021-01-07 04:12:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 04:12:54,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569910115] [2021-01-07 04:12:54,153 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:12:54,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948535444] [2021-01-07 04:12:54,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:12:54,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 04:12:54,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258563953] [2021-01-07 04:12:54,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:12:54,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:12:54,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:12:54,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:12:54,155 INFO L87 Difference]: Start difference. First operand 739 states and 948 transitions. Second operand 5 states. [2021-01-07 04:12:55,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:12:55,958 INFO L93 Difference]: Finished difference Result 1382 states and 1772 transitions. [2021-01-07 04:12:55,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:12:55,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2021-01-07 04:12:55,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:12:55,962 INFO L225 Difference]: With dead ends: 1382 [2021-01-07 04:12:55,963 INFO L226 Difference]: Without dead ends: 739 [2021-01-07 04:12:55,964 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 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 04:12:55,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2021-01-07 04:12:55,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2021-01-07 04:12:55,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2021-01-07 04:12:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 947 transitions. [2021-01-07 04:12:55,995 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 947 transitions. Word has length 110 [2021-01-07 04:12:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:12:55,995 INFO L481 AbstractCegarLoop]: Abstraction has 739 states and 947 transitions. [2021-01-07 04:12:55,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:12:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 947 transitions. [2021-01-07 04:12:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-07 04:12:55,998 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:12:55,998 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:56,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:12:56,212 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:12:56,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:12:56,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2117457625, now seen corresponding path program 1 times [2021-01-07 04:12:56,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:12:56,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208933008] [2021-01-07 04:12:56,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:12:56,236 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:12:56,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [752694051] [2021-01-07 04:12:56,236 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 04:12:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:12:56,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:12:56,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:12:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 04:12:56,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208933008] [2021-01-07 04:12:56,831 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:12:56,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752694051] [2021-01-07 04:12:56,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:12:56,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:12:56,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009110745] [2021-01-07 04:12:56,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:12:56,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:12:56,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:12:56,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:12:56,833 INFO L87 Difference]: Start difference. First operand 739 states and 947 transitions. Second operand 3 states. [2021-01-07 04:12:56,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:12:56,960 INFO L93 Difference]: Finished difference Result 1502 states and 1935 transitions. [2021-01-07 04:12:56,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:12:56,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2021-01-07 04:12:56,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:12:56,964 INFO L225 Difference]: With dead ends: 1502 [2021-01-07 04:12:56,965 INFO L226 Difference]: Without dead ends: 781 [2021-01-07 04:12:56,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:12:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2021-01-07 04:12:56,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 779. [2021-01-07 04:12:56,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2021-01-07 04:12:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 987 transitions. [2021-01-07 04:12:56,992 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 987 transitions. Word has length 157 [2021-01-07 04:12:56,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:12:56,992 INFO L481 AbstractCegarLoop]: Abstraction has 779 states and 987 transitions. [2021-01-07 04:12:56,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:12:56,992 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 987 transitions. [2021-01-07 04:12:56,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-07 04:12:56,994 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:12:56,995 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:57,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:12:57,209 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:12:57,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:12:57,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1572585051, now seen corresponding path program 1 times [2021-01-07 04:12:57,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:12:57,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993020574] [2021-01-07 04:12:57,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:12:57,232 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:12:57,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478819563] [2021-01-07 04:12:57,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 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 04:12:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:12:57,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:12:57,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:12:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 04:12:57,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993020574] [2021-01-07 04:12:57,864 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:12:57,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478819563] [2021-01-07 04:12:57,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:12:57,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:12:57,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554044245] [2021-01-07 04:12:57,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:12:57,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:12:57,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:12:57,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:12:57,866 INFO L87 Difference]: Start difference. First operand 779 states and 987 transitions. Second operand 4 states. [2021-01-07 04:12:57,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:12:57,987 INFO L93 Difference]: Finished difference Result 1496 states and 1900 transitions. [2021-01-07 04:12:57,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:12:57,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2021-01-07 04:12:57,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:12:57,992 INFO L225 Difference]: With dead ends: 1496 [2021-01-07 04:12:57,992 INFO L226 Difference]: Without dead ends: 753 [2021-01-07 04:12:57,994 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 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 04:12:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2021-01-07 04:12:58,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 751. [2021-01-07 04:12:58,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2021-01-07 04:12:58,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 945 transitions. [2021-01-07 04:12:58,021 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 945 transitions. Word has length 157 [2021-01-07 04:12:58,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:12:58,021 INFO L481 AbstractCegarLoop]: Abstraction has 751 states and 945 transitions. [2021-01-07 04:12:58,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:12:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 945 transitions. [2021-01-07 04:12:58,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-07 04:12:58,023 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:12:58,024 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:58,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-07 04:12:58,238 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:12:58,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:12:58,239 INFO L82 PathProgramCache]: Analyzing trace with hash 94293941, now seen corresponding path program 1 times [2021-01-07 04:12:58,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:12:58,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940231267] [2021-01-07 04:12:58,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:12:58,258 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:12:58,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1314405909] [2021-01-07 04:12:58,258 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 04:12:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:12:58,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 04:12:58,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:12:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 04:12:58,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940231267] [2021-01-07 04:12:58,904 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:12:58,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314405909] [2021-01-07 04:12:58,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:12:58,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 04:12:58,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338982448] [2021-01-07 04:12:58,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:12:58,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:12:58,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:12:58,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:12:58,906 INFO L87 Difference]: Start difference. First operand 751 states and 945 transitions. Second operand 5 states. [2021-01-07 04:12:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:12:59,119 INFO L93 Difference]: Finished difference Result 2209 states and 2786 transitions. [2021-01-07 04:12:59,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:12:59,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2021-01-07 04:12:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:12:59,128 INFO L225 Difference]: With dead ends: 2209 [2021-01-07 04:12:59,128 INFO L226 Difference]: Without dead ends: 1496 [2021-01-07 04:12:59,130 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:12:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2021-01-07 04:12:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 797. [2021-01-07 04:12:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2021-01-07 04:12:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 995 transitions. [2021-01-07 04:12:59,165 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 995 transitions. Word has length 157 [2021-01-07 04:12:59,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:12:59,166 INFO L481 AbstractCegarLoop]: Abstraction has 797 states and 995 transitions. [2021-01-07 04:12:59,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:12:59,166 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 995 transitions. [2021-01-07 04:12:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-07 04:12:59,168 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:12:59,168 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:12:59,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 04:12:59,384 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:12:59,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:12:59,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1994860229, now seen corresponding path program 1 times [2021-01-07 04:12:59,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:12:59,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611583611] [2021-01-07 04:12:59,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:12:59,417 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:12:59,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1254712568] [2021-01-07 04:12:59,417 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 04:12:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:12:59,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 04:12:59,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:12:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 04:12:59,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611583611] [2021-01-07 04:12:59,968 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:12:59,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254712568] [2021-01-07 04:12:59,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:12:59,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:12:59,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720260927] [2021-01-07 04:12:59,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:12:59,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:12:59,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:12:59,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:12:59,970 INFO L87 Difference]: Start difference. First operand 797 states and 995 transitions. Second operand 4 states. [2021-01-07 04:13:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:13:00,060 INFO L93 Difference]: Finished difference Result 1503 states and 1887 transitions. [2021-01-07 04:13:00,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:13:00,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2021-01-07 04:13:00,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:13:00,065 INFO L225 Difference]: With dead ends: 1503 [2021-01-07 04:13:00,065 INFO L226 Difference]: Without dead ends: 733 [2021-01-07 04:13:00,067 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 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 04:13:00,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2021-01-07 04:13:00,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2021-01-07 04:13:00,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2021-01-07 04:13:00,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 917 transitions. [2021-01-07 04:13:00,096 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 917 transitions. Word has length 157 [2021-01-07 04:13:00,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:13:00,097 INFO L481 AbstractCegarLoop]: Abstraction has 733 states and 917 transitions. [2021-01-07 04:13:00,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:13:00,097 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 917 transitions. [2021-01-07 04:13:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-07 04:13:00,099 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:13:00,099 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:13:00,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-07 04:13:00,314 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:13:00,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:13:00,315 INFO L82 PathProgramCache]: Analyzing trace with hash 639166515, now seen corresponding path program 1 times [2021-01-07 04:13:00,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:13:00,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137683012] [2021-01-07 04:13:00,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:13:00,337 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:13:00,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1629407306] [2021-01-07 04:13:00,338 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 [2021-01-07 04:13:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:13:00,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-07 04:13:00,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:13:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 04:13:00,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137683012] [2021-01-07 04:13:00,990 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:13:00,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629407306] [2021-01-07 04:13:00,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:13:00,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-01-07 04:13:00,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189345938] [2021-01-07 04:13:00,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:13:00,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:13:00,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:13:00,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:13:00,992 INFO L87 Difference]: Start difference. First operand 733 states and 917 transitions. Second operand 6 states. [2021-01-07 04:13:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:13:01,108 INFO L93 Difference]: Finished difference Result 1424 states and 1796 transitions. [2021-01-07 04:13:01,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 04:13:01,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2021-01-07 04:13:01,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:13:01,113 INFO L225 Difference]: With dead ends: 1424 [2021-01-07 04:13:01,113 INFO L226 Difference]: Without dead ends: 739 [2021-01-07 04:13:01,115 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:13:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2021-01-07 04:13:01,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2021-01-07 04:13:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2021-01-07 04:13:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 923 transitions. [2021-01-07 04:13:01,145 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 923 transitions. Word has length 157 [2021-01-07 04:13:01,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:13:01,145 INFO L481 AbstractCegarLoop]: Abstraction has 739 states and 923 transitions. [2021-01-07 04:13:01,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:13:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 923 transitions. [2021-01-07 04:13:01,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-01-07 04:13:01,147 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:13:01,148 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:13:01,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:13:01,363 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:13:01,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:13:01,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1050888114, now seen corresponding path program 2 times [2021-01-07 04:13:01,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:13:01,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866457865] [2021-01-07 04:13:01,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:13:01,384 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:13:01,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1904889650] [2021-01-07 04:13:01,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:13:01,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:13:01,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:13:01,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 04:13:01,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:13:02,129 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-07 04:13:02,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866457865] [2021-01-07 04:13:02,130 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:13:02,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904889650] [2021-01-07 04:13:02,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:13:02,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-01-07 04:13:02,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478750174] [2021-01-07 04:13:02,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 04:13:02,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:13:02,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 04:13:02,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:13:02,135 INFO L87 Difference]: Start difference. First operand 739 states and 923 transitions. Second operand 7 states. [2021-01-07 04:13:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:13:02,283 INFO L93 Difference]: Finished difference Result 1435 states and 1807 transitions. [2021-01-07 04:13:02,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 04:13:02,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 159 [2021-01-07 04:13:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:13:02,288 INFO L225 Difference]: With dead ends: 1435 [2021-01-07 04:13:02,289 INFO L226 Difference]: Without dead ends: 745 [2021-01-07 04:13:02,290 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:13:02,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2021-01-07 04:13:02,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2021-01-07 04:13:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2021-01-07 04:13:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 929 transitions. [2021-01-07 04:13:02,328 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 929 transitions. Word has length 159 [2021-01-07 04:13:02,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:13:02,329 INFO L481 AbstractCegarLoop]: Abstraction has 745 states and 929 transitions. [2021-01-07 04:13:02,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 04:13:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 929 transitions. [2021-01-07 04:13:02,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-01-07 04:13:02,332 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:13:02,332 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:13:02,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-07 04:13:02,547 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:13:02,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:13:02,547 INFO L82 PathProgramCache]: Analyzing trace with hash 770488787, now seen corresponding path program 3 times [2021-01-07 04:13:02,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:13:02,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594990708] [2021-01-07 04:13:02,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:13:02,588 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:13:02,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [603725268] [2021-01-07 04:13:02,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:13:03,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 04:13:03,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:13:03,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:13:03,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:13:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-01-07 04:13:03,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594990708] [2021-01-07 04:13:03,316 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:13:03,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603725268] [2021-01-07 04:13:03,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:13:03,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:13:03,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364243107] [2021-01-07 04:13:03,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:13:03,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:13:03,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:13:03,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:13:03,321 INFO L87 Difference]: Start difference. First operand 745 states and 929 transitions. Second operand 3 states. [2021-01-07 04:13:03,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:13:03,454 INFO L93 Difference]: Finished difference Result 1749 states and 2217 transitions. [2021-01-07 04:13:03,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:13:03,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2021-01-07 04:13:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:13:03,461 INFO L225 Difference]: With dead ends: 1749 [2021-01-07 04:13:03,462 INFO L226 Difference]: Without dead ends: 1063 [2021-01-07 04:13:03,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:13:03,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2021-01-07 04:13:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 906. [2021-01-07 04:13:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2021-01-07 04:13:03,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1156 transitions. [2021-01-07 04:13:03,513 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1156 transitions. Word has length 161 [2021-01-07 04:13:03,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:13:03,513 INFO L481 AbstractCegarLoop]: Abstraction has 906 states and 1156 transitions. [2021-01-07 04:13:03,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:13:03,514 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1156 transitions. [2021-01-07 04:13:03,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-07 04:13:03,516 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:13:03,516 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:13:03,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-07 04:13:03,730 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:13:03,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:13:03,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1484056676, now seen corresponding path program 1 times [2021-01-07 04:13:03,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:13:03,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152887419] [2021-01-07 04:13:03,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:13:03,755 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:13:03,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [155131260] [2021-01-07 04:13:03,755 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:13:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:13:04,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-07 04:13:04,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:13:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-01-07 04:13:04,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152887419] [2021-01-07 04:13:04,503 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:13:04,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155131260] [2021-01-07 04:13:04,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:13:04,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2021-01-07 04:13:04,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240394629] [2021-01-07 04:13:04,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 04:13:04,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:13:04,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 04:13:04,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:13:04,506 INFO L87 Difference]: Start difference. First operand 906 states and 1156 transitions. Second operand 8 states. [2021-01-07 04:13:04,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:13:04,646 INFO L93 Difference]: Finished difference Result 1770 states and 2275 transitions. [2021-01-07 04:13:04,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 04:13:04,646 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2021-01-07 04:13:04,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:13:04,651 INFO L225 Difference]: With dead ends: 1770 [2021-01-07 04:13:04,651 INFO L226 Difference]: Without dead ends: 912 [2021-01-07 04:13:04,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:13:04,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2021-01-07 04:13:04,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 912. [2021-01-07 04:13:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2021-01-07 04:13:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1162 transitions. [2021-01-07 04:13:04,687 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1162 transitions. Word has length 178 [2021-01-07 04:13:04,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:13:04,687 INFO L481 AbstractCegarLoop]: Abstraction has 912 states and 1162 transitions. [2021-01-07 04:13:04,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 04:13:04,687 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1162 transitions. [2021-01-07 04:13:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-01-07 04:13:04,689 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:13:04,690 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:13:04,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:13:04,905 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:13:04,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:13:04,906 INFO L82 PathProgramCache]: Analyzing trace with hash -453644734, now seen corresponding path program 2 times [2021-01-07 04:13:04,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:13:04,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921995287] [2021-01-07 04:13:04,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:13:04,936 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:13:04,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [400806851] [2021-01-07 04:13:04,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:13:05,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:13:05,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:13:05,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 04:13:05,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:13:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-01-07 04:13:05,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921995287] [2021-01-07 04:13:05,806 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:13:05,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400806851] [2021-01-07 04:13:05,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:13:05,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-01-07 04:13:05,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132706211] [2021-01-07 04:13:05,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 04:13:05,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:13:05,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 04:13:05,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-01-07 04:13:05,808 INFO L87 Difference]: Start difference. First operand 912 states and 1162 transitions. Second operand 9 states. [2021-01-07 04:13:05,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:13:05,962 INFO L93 Difference]: Finished difference Result 1781 states and 2286 transitions. [2021-01-07 04:13:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 04:13:05,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 182 [2021-01-07 04:13:05,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:13:05,968 INFO L225 Difference]: With dead ends: 1781 [2021-01-07 04:13:05,968 INFO L226 Difference]: Without dead ends: 918 [2021-01-07 04:13:05,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-01-07 04:13:05,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2021-01-07 04:13:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2021-01-07 04:13:06,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2021-01-07 04:13:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1168 transitions. [2021-01-07 04:13:06,006 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1168 transitions. Word has length 182 [2021-01-07 04:13:06,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:13:06,006 INFO L481 AbstractCegarLoop]: Abstraction has 918 states and 1168 transitions. [2021-01-07 04:13:06,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 04:13:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1168 transitions. [2021-01-07 04:13:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-01-07 04:13:06,008 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:13:06,008 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:13:06,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:13:06,222 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:13:06,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:13:06,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1986963428, now seen corresponding path program 3 times [2021-01-07 04:13:06,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:13:06,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768467767] [2021-01-07 04:13:06,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:13:06,248 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:13:06,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269216107] [2021-01-07 04:13:06,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:13:06,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 04:13:06,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:13:06,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 04:13:06,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:13:07,141 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-01-07 04:13:07,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768467767] [2021-01-07 04:13:07,142 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:13:07,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269216107] [2021-01-07 04:13:07,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:13:07,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:13:07,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602687740] [2021-01-07 04:13:07,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:13:07,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:13:07,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:13:07,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:13:07,144 INFO L87 Difference]: Start difference. First operand 918 states and 1168 transitions. Second operand 4 states. [2021-01-07 04:13:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:13:07,859 INFO L93 Difference]: Finished difference Result 1509 states and 1921 transitions. [2021-01-07 04:13:07,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:13:07,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2021-01-07 04:13:07,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:13:07,863 INFO L225 Difference]: With dead ends: 1509 [2021-01-07 04:13:07,863 INFO L226 Difference]: Without dead ends: 732 [2021-01-07 04:13:07,865 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 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 04:13:07,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2021-01-07 04:13:07,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2021-01-07 04:13:07,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2021-01-07 04:13:07,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 909 transitions. [2021-01-07 04:13:07,896 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 909 transitions. Word has length 186 [2021-01-07 04:13:07,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:13:07,897 INFO L481 AbstractCegarLoop]: Abstraction has 732 states and 909 transitions. [2021-01-07 04:13:07,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:13:07,897 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 909 transitions. [2021-01-07 04:13:07,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-01-07 04:13:07,898 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:13:07,898 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:13:08,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:13:08,112 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:13:08,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:13:08,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1622468887, now seen corresponding path program 1 times [2021-01-07 04:13:08,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:13:08,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196472663] [2021-01-07 04:13:08,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:13:08,134 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:13:08,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733610218] [2021-01-07 04:13:08,134 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:13:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:13:08,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 10 conjunts are in the unsatisfiable core [2021-01-07 04:13:08,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:13:08,968 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-01-07 04:13:08,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196472663] [2021-01-07 04:13:08,969 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:13:08,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733610218] [2021-01-07 04:13:08,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:13:08,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2021-01-07 04:13:08,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564223870] [2021-01-07 04:13:08,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 04:13:08,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:13:08,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 04:13:08,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-01-07 04:13:08,971 INFO L87 Difference]: Start difference. First operand 732 states and 909 transitions. Second operand 10 states. [2021-01-07 04:13:09,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:13:09,149 INFO L93 Difference]: Finished difference Result 1418 states and 1775 transitions. [2021-01-07 04:13:09,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 04:13:09,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 193 [2021-01-07 04:13:09,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:13:09,156 INFO L225 Difference]: With dead ends: 1418 [2021-01-07 04:13:09,157 INFO L226 Difference]: Without dead ends: 736 [2021-01-07 04:13:09,159 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-01-07 04:13:09,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2021-01-07 04:13:09,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2021-01-07 04:13:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2021-01-07 04:13:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 913 transitions. [2021-01-07 04:13:09,190 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 913 transitions. Word has length 193 [2021-01-07 04:13:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:13:09,190 INFO L481 AbstractCegarLoop]: Abstraction has 736 states and 913 transitions. [2021-01-07 04:13:09,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 04:13:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 913 transitions. [2021-01-07 04:13:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-01-07 04:13:09,192 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:13:09,192 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:13:09,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-01-07 04:13:09,407 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:13:09,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:13:09,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1336921525, now seen corresponding path program 2 times [2021-01-07 04:13:09,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:13:09,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612700447] [2021-01-07 04:13:09,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:13:09,429 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:13:09,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2115395509] [2021-01-07 04:13:09,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:13:10,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:13:10,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:13:10,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 11 conjunts are in the unsatisfiable core [2021-01-07 04:13:10,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:13:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2021-01-07 04:13:10,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612700447] [2021-01-07 04:13:10,440 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:13:10,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115395509] [2021-01-07 04:13:10,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:13:10,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-01-07 04:13:10,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803302705] [2021-01-07 04:13:10,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 04:13:10,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:13:10,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 04:13:10,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-01-07 04:13:10,442 INFO L87 Difference]: Start difference. First operand 736 states and 913 transitions. Second operand 11 states. [2021-01-07 04:13:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:13:10,649 INFO L93 Difference]: Finished difference Result 1425 states and 1782 transitions. [2021-01-07 04:13:10,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 04:13:10,650 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 197 [2021-01-07 04:13:10,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:13:10,654 INFO L225 Difference]: With dead ends: 1425 [2021-01-07 04:13:10,654 INFO L226 Difference]: Without dead ends: 740 [2021-01-07 04:13:10,656 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-01-07 04:13:10,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-01-07 04:13:10,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2021-01-07 04:13:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2021-01-07 04:13:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 917 transitions. [2021-01-07 04:13:10,690 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 917 transitions. Word has length 197 [2021-01-07 04:13:10,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:13:10,690 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 917 transitions. [2021-01-07 04:13:10,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-07 04:13:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 917 transitions. [2021-01-07 04:13:10,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-01-07 04:13:10,692 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:13:10,692 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:13:10,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-01-07 04:13:10,906 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:13:10,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:13:10,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1628837737, now seen corresponding path program 3 times [2021-01-07 04:13:10,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:13:10,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658929324] [2021-01-07 04:13:10,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:13:10,930 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:13:10,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [549295341] [2021-01-07 04:13:10,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true