/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_OAT_test2-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 04:30:00,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 04:30:00,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 04:30:00,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 04:30:00,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 04:30:00,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 04:30:00,232 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 04:30:00,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 04:30:00,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 04:30:00,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 04:30:00,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 04:30:00,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 04:30:00,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 04:30:00,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 04:30:00,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 04:30:00,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 04:30:00,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 04:30:00,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 04:30:00,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 04:30:00,269 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 04:30:00,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 04:30:00,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 04:30:00,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 04:30:00,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 04:30:00,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 04:30:00,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 04:30:00,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 04:30:00,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 04:30:00,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 04:30:00,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 04:30:00,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 04:30:00,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 04:30:00,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 04:30:00,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 04:30:00,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 04:30:00,289 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 04:30:00,290 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 04:30:00,290 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 04:30:00,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 04:30:00,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 04:30:00,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 04:30:00,294 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:30:00,324 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 04:30:00,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 04:30:00,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 04:30:00,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 04:30:00,327 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 04:30:00,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 04:30:00,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 04:30:00,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 04:30:00,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 04:30:00,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 04:30:00,329 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 04:30:00,329 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 04:30:00,329 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 04:30:00,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 04:30:00,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 04:30:00,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 04:30:00,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 04:30:00,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 04:30:00,331 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 04:30:00,332 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 04:30:00,332 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 04:30:00,332 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 04:30:00,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 04:30:00,333 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 04:30:00,333 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 04:30:00,333 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:30:00,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 04:30:00,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 04:30:00,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 04:30:00,783 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 04:30:00,783 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 04:30:00,784 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_OAT_test2-1.i [2021-01-07 04:30:00,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/29e38b66d/70f89bf9bfa14c859723c283e4fe85fd/FLAGae459a925 [2021-01-07 04:30:01,847 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 04:30:01,848 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i [2021-01-07 04:30:01,890 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/29e38b66d/70f89bf9bfa14c859723c283e4fe85fd/FLAGae459a925 [2021-01-07 04:30:02,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/29e38b66d/70f89bf9bfa14c859723c283e4fe85fd [2021-01-07 04:30:02,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 04:30:02,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 04:30:02,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 04:30:02,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 04:30:02,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 04:30:02,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:30:02" (1/1) ... [2021-01-07 04:30:02,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e602df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:02, skipping insertion in model container [2021-01-07 04:30:02,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:30:02" (1/1) ... [2021-01-07 04:30:02,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 04:30:02,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 04:30:02,703 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_OAT_test2-1.i[37019,37032] 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[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] 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: 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,] [2021-01-07 04:30:02,828 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_OAT_test2-1.i[47352,47365] [2021-01-07 04:30:02,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:30:02,852 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 04:30:02,891 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_OAT_test2-1.i[37019,37032] 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~mem42,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem42,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem44,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem44,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem45,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem45,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem46,],base],StructAccessExpression[IdentifierExpression[#t~mem46,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem48,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem48,],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~mem61,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem61,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem62,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem62,],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~mem74,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem74,],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~mem88,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem88,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem98,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem98,],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~mem125,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem125,],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~mem133,],base],StructAccessExpression[IdentifierExpression[#t~mem133,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem135,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem135,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem145,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem145,],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~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: 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,] [2021-01-07 04:30:03,010 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_OAT_test2-1.i[47352,47365] [2021-01-07 04:30:03,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:30:03,175 INFO L208 MainTranslator]: Completed translation [2021-01-07 04:30:03,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:03 WrapperNode [2021-01-07 04:30:03,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 04:30:03,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 04:30:03,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 04:30:03,178 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 04:30:03,188 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:30:03" (1/1) ... [2021-01-07 04:30:03,226 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:30:03" (1/1) ... [2021-01-07 04:30:03,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 04:30:03,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 04:30:03,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 04:30:03,341 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 04:30:03,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:03" (1/1) ... [2021-01-07 04:30:03,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:03" (1/1) ... [2021-01-07 04:30:03,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:03" (1/1) ... [2021-01-07 04:30:03,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:03" (1/1) ... [2021-01-07 04:30:03,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:03" (1/1) ... [2021-01-07 04:30:03,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:03" (1/1) ... [2021-01-07 04:30:03,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:03" (1/1) ... [2021-01-07 04:30:03,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 04:30:03,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 04:30:03,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 04:30:03,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 04:30:03,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:03" (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:30:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 04:30:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-01-07 04:30:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 04:30:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 04:30:03,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 04:30:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 04:30:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 04:30:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 04:30:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 04:30:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 04:30:03,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 04:30:05,497 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 04:30:05,497 INFO L299 CfgBuilder]: Removed 76 assume(true) statements. [2021-01-07 04:30:05,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:30:05 BoogieIcfgContainer [2021-01-07 04:30:05,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 04:30:05,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 04:30:05,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 04:30:05,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 04:30:05,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 04:30:02" (1/3) ... [2021-01-07 04:30:05,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267b0b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:30:05, skipping insertion in model container [2021-01-07 04:30:05,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:03" (2/3) ... [2021-01-07 04:30:05,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267b0b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:30:05, skipping insertion in model container [2021-01-07 04:30:05,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:30:05" (3/3) ... [2021-01-07 04:30:05,511 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test2-1.i [2021-01-07 04:30:05,519 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 04:30:05,526 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2021-01-07 04:30:05,548 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-01-07 04:30:05,580 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 04:30:05,580 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 04:30:05,580 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 04:30:05,580 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 04:30:05,581 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 04:30:05,581 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 04:30:05,581 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 04:30:05,581 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 04:30:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states. [2021-01-07 04:30:05,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-07 04:30:05,612 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:05,613 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:05,614 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:05,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:05,621 INFO L82 PathProgramCache]: Analyzing trace with hash 239231399, now seen corresponding path program 1 times [2021-01-07 04:30:05,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:05,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646721099] [2021-01-07 04:30:05,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:05,816 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:30:05,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646721099] [2021-01-07 04:30:05,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:05,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:30:05,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099455498] [2021-01-07 04:30:05,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 04:30:05,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:05,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 04:30:05,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:30:05,844 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 2 states. [2021-01-07 04:30:05,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:05,899 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2021-01-07 04:30:05,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 04:30:05,901 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2021-01-07 04:30:05,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:05,915 INFO L225 Difference]: With dead ends: 352 [2021-01-07 04:30:05,916 INFO L226 Difference]: Without dead ends: 173 [2021-01-07 04:30:05,920 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:30:05,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-01-07 04:30:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2021-01-07 04:30:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2021-01-07 04:30:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 225 transitions. [2021-01-07 04:30:05,979 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 225 transitions. Word has length 9 [2021-01-07 04:30:05,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:05,979 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 225 transitions. [2021-01-07 04:30:05,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 04:30:05,979 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 225 transitions. [2021-01-07 04:30:05,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 04:30:05,982 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:05,982 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:30:05,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 04:30:05,983 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:05,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:05,984 INFO L82 PathProgramCache]: Analyzing trace with hash 627334177, now seen corresponding path program 1 times [2021-01-07 04:30:05,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:05,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641364142] [2021-01-07 04:30:05,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:06,092 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:30:06,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641364142] [2021-01-07 04:30:06,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:06,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:30:06,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699886502] [2021-01-07 04:30:06,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:30:06,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:06,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:30:06,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:30:06,097 INFO L87 Difference]: Start difference. First operand 173 states and 225 transitions. Second operand 4 states. [2021-01-07 04:30:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:07,370 INFO L93 Difference]: Finished difference Result 377 states and 490 transitions. [2021-01-07 04:30:07,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:30:07,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2021-01-07 04:30:07,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:07,374 INFO L225 Difference]: With dead ends: 377 [2021-01-07 04:30:07,374 INFO L226 Difference]: Without dead ends: 294 [2021-01-07 04:30:07,376 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:30:07,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-01-07 04:30:07,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 175. [2021-01-07 04:30:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2021-01-07 04:30:07,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 227 transitions. [2021-01-07 04:30:07,393 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 227 transitions. Word has length 44 [2021-01-07 04:30:07,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:07,394 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 227 transitions. [2021-01-07 04:30:07,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:30:07,394 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 227 transitions. [2021-01-07 04:30:07,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-07 04:30:07,398 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:07,398 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] [2021-01-07 04:30:07,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 04:30:07,399 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:07,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:07,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1103505073, now seen corresponding path program 1 times [2021-01-07 04:30:07,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:07,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236935531] [2021-01-07 04:30:07,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:07,430 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:07,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1257087279] [2021-01-07 04:30:07,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:30:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:07,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:30:07,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:07,892 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:30:07,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236935531] [2021-01-07 04:30:07,895 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:07,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257087279] [2021-01-07 04:30:07,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:07,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:30:07,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484095841] [2021-01-07 04:30:07,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:30:07,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:07,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:30:07,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:30:07,907 INFO L87 Difference]: Start difference. First operand 175 states and 227 transitions. Second operand 3 states. [2021-01-07 04:30:07,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:07,999 INFO L93 Difference]: Finished difference Result 367 states and 481 transitions. [2021-01-07 04:30:08,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:30:08,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-07 04:30:08,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:08,004 INFO L225 Difference]: With dead ends: 367 [2021-01-07 04:30:08,004 INFO L226 Difference]: Without dead ends: 196 [2021-01-07 04:30:08,009 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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:30:08,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-01-07 04:30:08,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2021-01-07 04:30:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2021-01-07 04:30:08,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 247 transitions. [2021-01-07 04:30:08,041 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 247 transitions. Word has length 96 [2021-01-07 04:30:08,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:08,045 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 247 transitions. [2021-01-07 04:30:08,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:30:08,045 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 247 transitions. [2021-01-07 04:30:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-07 04:30:08,052 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:08,053 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] [2021-01-07 04:30:08,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-07 04:30:08,270 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:08,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:08,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1343744819, now seen corresponding path program 1 times [2021-01-07 04:30:08,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:08,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715913710] [2021-01-07 04:30:08,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:08,313 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:08,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1324688333] [2021-01-07 04:30:08,316 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:30:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:08,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:30:08,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:08,849 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:30:08,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715913710] [2021-01-07 04:30:08,849 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:08,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324688333] [2021-01-07 04:30:08,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:08,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:30:08,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541267759] [2021-01-07 04:30:08,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:30:08,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:08,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:30:08,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:30:08,852 INFO L87 Difference]: Start difference. First operand 195 states and 247 transitions. Second operand 3 states. [2021-01-07 04:30:08,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:08,969 INFO L93 Difference]: Finished difference Result 298 states and 384 transitions. [2021-01-07 04:30:08,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:30:08,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-07 04:30:08,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:08,972 INFO L225 Difference]: With dead ends: 298 [2021-01-07 04:30:08,972 INFO L226 Difference]: Without dead ends: 216 [2021-01-07 04:30:08,973 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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:30:08,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-01-07 04:30:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2021-01-07 04:30:08,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2021-01-07 04:30:08,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 267 transitions. [2021-01-07 04:30:08,982 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 267 transitions. Word has length 96 [2021-01-07 04:30:08,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:08,983 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 267 transitions. [2021-01-07 04:30:08,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:30:08,983 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 267 transitions. [2021-01-07 04:30:08,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-07 04:30:08,985 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:08,986 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] [2021-01-07 04:30:09,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:09,201 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:09,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:09,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1663949871, now seen corresponding path program 1 times [2021-01-07 04:30:09,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:09,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866574968] [2021-01-07 04:30:09,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:09,225 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:09,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [72584552] [2021-01-07 04:30:09,225 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:30:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:09,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:30:09,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:09,570 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:30:09,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866574968] [2021-01-07 04:30:09,571 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:09,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72584552] [2021-01-07 04:30:09,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:09,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:30:09,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193988897] [2021-01-07 04:30:09,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:30:09,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:09,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:30:09,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:30:09,574 INFO L87 Difference]: Start difference. First operand 215 states and 267 transitions. Second operand 4 states. [2021-01-07 04:30:09,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:09,672 INFO L93 Difference]: Finished difference Result 418 states and 522 transitions. [2021-01-07 04:30:09,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:30:09,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2021-01-07 04:30:09,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:09,674 INFO L225 Difference]: With dead ends: 418 [2021-01-07 04:30:09,674 INFO L226 Difference]: Without dead ends: 207 [2021-01-07 04:30:09,675 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 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:30:09,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-01-07 04:30:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 201. [2021-01-07 04:30:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2021-01-07 04:30:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 246 transitions. [2021-01-07 04:30:09,682 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 246 transitions. Word has length 96 [2021-01-07 04:30:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:09,682 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 246 transitions. [2021-01-07 04:30:09,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:30:09,683 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 246 transitions. [2021-01-07 04:30:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-07 04:30:09,684 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:09,684 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] [2021-01-07 04:30:09,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:09,898 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:09,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:09,900 INFO L82 PathProgramCache]: Analyzing trace with hash 569918303, now seen corresponding path program 1 times [2021-01-07 04:30:09,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:09,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688130670] [2021-01-07 04:30:09,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:09,920 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:09,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1174673188] [2021-01-07 04:30:09,920 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:30:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:10,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:30:10,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:10,283 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:30:10,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688130670] [2021-01-07 04:30:10,284 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:10,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174673188] [2021-01-07 04:30:10,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:10,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:30:10,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083766108] [2021-01-07 04:30:10,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:30:10,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:10,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:30:10,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:30:10,288 INFO L87 Difference]: Start difference. First operand 201 states and 246 transitions. Second operand 4 states. [2021-01-07 04:30:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:10,402 INFO L93 Difference]: Finished difference Result 295 states and 364 transitions. [2021-01-07 04:30:10,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:30:10,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2021-01-07 04:30:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:10,406 INFO L225 Difference]: With dead ends: 295 [2021-01-07 04:30:10,406 INFO L226 Difference]: Without dead ends: 193 [2021-01-07 04:30:10,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 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:30:10,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-01-07 04:30:10,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 187. [2021-01-07 04:30:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2021-01-07 04:30:10,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 225 transitions. [2021-01-07 04:30:10,415 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 225 transitions. Word has length 96 [2021-01-07 04:30:10,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:10,415 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 225 transitions. [2021-01-07 04:30:10,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:30:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 225 transitions. [2021-01-07 04:30:10,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-07 04:30:10,417 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:10,417 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] [2021-01-07 04:30:10,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:10,634 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:10,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:10,635 INFO L82 PathProgramCache]: Analyzing trace with hash -312930543, now seen corresponding path program 1 times [2021-01-07 04:30:10,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:10,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97019833] [2021-01-07 04:30:10,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:10,660 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:10,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1275316598] [2021-01-07 04:30:10,661 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:30:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:10,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:30:10,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:10,996 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:30:10,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97019833] [2021-01-07 04:30:10,997 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:10,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275316598] [2021-01-07 04:30:10,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:10,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:30:10,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362544844] [2021-01-07 04:30:10,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:30:10,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:10,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:30:11,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:30:11,000 INFO L87 Difference]: Start difference. First operand 187 states and 225 transitions. Second operand 3 states. [2021-01-07 04:30:11,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:11,075 INFO L93 Difference]: Finished difference Result 486 states and 579 transitions. [2021-01-07 04:30:11,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:30:11,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-07 04:30:11,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:11,078 INFO L225 Difference]: With dead ends: 486 [2021-01-07 04:30:11,078 INFO L226 Difference]: Without dead ends: 303 [2021-01-07 04:30:11,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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:30:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-01-07 04:30:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 291. [2021-01-07 04:30:11,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2021-01-07 04:30:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 350 transitions. [2021-01-07 04:30:11,090 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 350 transitions. Word has length 96 [2021-01-07 04:30:11,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:11,090 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 350 transitions. [2021-01-07 04:30:11,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:30:11,091 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 350 transitions. [2021-01-07 04:30:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-01-07 04:30:11,092 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:11,092 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] [2021-01-07 04:30:11,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-07 04:30:11,308 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:11,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:11,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1090926304, now seen corresponding path program 1 times [2021-01-07 04:30:11,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:11,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938937831] [2021-01-07 04:30:11,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:11,349 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:11,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1053971991] [2021-01-07 04:30:11,354 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:30:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:11,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:30:11,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:11,714 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:30:11,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938937831] [2021-01-07 04:30:11,715 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:11,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053971991] [2021-01-07 04:30:11,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:11,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:30:11,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200719042] [2021-01-07 04:30:11,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:30:11,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:11,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:30:11,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:30:11,724 INFO L87 Difference]: Start difference. First operand 291 states and 350 transitions. Second operand 3 states. [2021-01-07 04:30:11,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:11,760 INFO L93 Difference]: Finished difference Result 536 states and 651 transitions. [2021-01-07 04:30:11,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:30:11,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2021-01-07 04:30:11,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:11,763 INFO L225 Difference]: With dead ends: 536 [2021-01-07 04:30:11,763 INFO L226 Difference]: Without dead ends: 293 [2021-01-07 04:30:11,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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:30:11,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-01-07 04:30:11,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2021-01-07 04:30:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2021-01-07 04:30:11,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 352 transitions. [2021-01-07 04:30:11,775 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 352 transitions. Word has length 103 [2021-01-07 04:30:11,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:11,775 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 352 transitions. [2021-01-07 04:30:11,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:30:11,775 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 352 transitions. [2021-01-07 04:30:11,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-07 04:30:11,777 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:11,777 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] [2021-01-07 04:30:11,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:11,992 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:11,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:11,993 INFO L82 PathProgramCache]: Analyzing trace with hash 77446145, now seen corresponding path program 1 times [2021-01-07 04:30:11,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:11,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179618138] [2021-01-07 04:30:11,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:12,013 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:12,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1157013892] [2021-01-07 04:30:12,019 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:30:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:12,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 04:30:12,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:12,385 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:30:12,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179618138] [2021-01-07 04:30:12,386 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:12,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157013892] [2021-01-07 04:30:12,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:30:12,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2021-01-07 04:30:12,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454880170] [2021-01-07 04:30:12,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:30:12,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:12,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:30:12,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:30:12,396 INFO L87 Difference]: Start difference. First operand 293 states and 352 transitions. Second operand 4 states. [2021-01-07 04:30:12,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:12,439 INFO L93 Difference]: Finished difference Result 540 states and 655 transitions. [2021-01-07 04:30:12,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:30:12,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2021-01-07 04:30:12,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:12,443 INFO L225 Difference]: With dead ends: 540 [2021-01-07 04:30:12,443 INFO L226 Difference]: Without dead ends: 295 [2021-01-07 04:30:12,444 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 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:30:12,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-01-07 04:30:12,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2021-01-07 04:30:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2021-01-07 04:30:12,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 354 transitions. [2021-01-07 04:30:12,459 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 354 transitions. Word has length 105 [2021-01-07 04:30:12,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:12,460 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 354 transitions. [2021-01-07 04:30:12,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:30:12,460 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 354 transitions. [2021-01-07 04:30:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-07 04:30:12,462 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:12,462 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] [2021-01-07 04:30:12,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:12,677 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:12,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:12,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1213198784, now seen corresponding path program 2 times [2021-01-07 04:30:12,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:12,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760279735] [2021-01-07 04:30:12,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:12,699 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:12,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1403448797] [2021-01-07 04:30:12,700 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:30:13,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:30:13,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:30:13,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:30:13,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:13,151 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:30:13,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760279735] [2021-01-07 04:30:13,151 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:13,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403448797] [2021-01-07 04:30:13,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:30:13,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2021-01-07 04:30:13,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316817870] [2021-01-07 04:30:13,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:30:13,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:13,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:30:13,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:30:13,154 INFO L87 Difference]: Start difference. First operand 295 states and 354 transitions. Second operand 5 states. [2021-01-07 04:30:13,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:13,218 INFO L93 Difference]: Finished difference Result 544 states and 659 transitions. [2021-01-07 04:30:13,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:30:13,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2021-01-07 04:30:13,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:13,221 INFO L225 Difference]: With dead ends: 544 [2021-01-07 04:30:13,221 INFO L226 Difference]: Without dead ends: 297 [2021-01-07 04:30:13,222 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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:30:13,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-01-07 04:30:13,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2021-01-07 04:30:13,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2021-01-07 04:30:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 356 transitions. [2021-01-07 04:30:13,232 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 356 transitions. Word has length 107 [2021-01-07 04:30:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:13,233 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 356 transitions. [2021-01-07 04:30:13,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:30:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 356 transitions. [2021-01-07 04:30:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-07 04:30:13,234 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:13,234 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] [2021-01-07 04:30:13,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 04:30:13,451 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:13,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:13,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1565711009, now seen corresponding path program 3 times [2021-01-07 04:30:13,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:13,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247279059] [2021-01-07 04:30:13,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:13,471 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:13,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843024158] [2021-01-07 04:30:13,472 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:30:13,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 04:30:13,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:30:13,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 04:30:13,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:14,068 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:30:14,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247279059] [2021-01-07 04:30:14,069 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:14,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843024158] [2021-01-07 04:30:14,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:14,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:30:14,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980877227] [2021-01-07 04:30:14,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:30:14,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:14,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:30:14,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:30:14,071 INFO L87 Difference]: Start difference. First operand 297 states and 356 transitions. Second operand 4 states. [2021-01-07 04:30:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:14,596 INFO L93 Difference]: Finished difference Result 486 states and 583 transitions. [2021-01-07 04:30:14,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:30:14,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2021-01-07 04:30:14,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:14,599 INFO L225 Difference]: With dead ends: 486 [2021-01-07 04:30:14,599 INFO L226 Difference]: Without dead ends: 237 [2021-01-07 04:30:14,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 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:30:14,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-01-07 04:30:14,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2021-01-07 04:30:14,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2021-01-07 04:30:14,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 278 transitions. [2021-01-07 04:30:14,610 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 278 transitions. Word has length 109 [2021-01-07 04:30:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:14,610 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 278 transitions. [2021-01-07 04:30:14,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:30:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 278 transitions. [2021-01-07 04:30:14,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-07 04:30:14,612 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:14,612 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] [2021-01-07 04:30:14,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:14,826 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:14,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:14,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2033164455, now seen corresponding path program 1 times [2021-01-07 04:30:14,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:14,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613248567] [2021-01-07 04:30:14,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:14,848 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:14,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1951777055] [2021-01-07 04:30:14,848 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:30:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:15,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-07 04:30:15,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:15,273 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:30:15,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613248567] [2021-01-07 04:30:15,274 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:15,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951777055] [2021-01-07 04:30:15,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:30:15,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-01-07 04:30:15,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716823686] [2021-01-07 04:30:15,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:30:15,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:15,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:30:15,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:30:15,277 INFO L87 Difference]: Start difference. First operand 237 states and 278 transitions. Second operand 6 states. [2021-01-07 04:30:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:15,332 INFO L93 Difference]: Finished difference Result 422 states and 500 transitions. [2021-01-07 04:30:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 04:30:15,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2021-01-07 04:30:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:15,334 INFO L225 Difference]: With dead ends: 422 [2021-01-07 04:30:15,334 INFO L226 Difference]: Without dead ends: 239 [2021-01-07 04:30:15,335 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 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:30:15,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-01-07 04:30:15,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-01-07 04:30:15,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-07 04:30:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 280 transitions. [2021-01-07 04:30:15,345 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 280 transitions. Word has length 116 [2021-01-07 04:30:15,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:15,346 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 280 transitions. [2021-01-07 04:30:15,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:30:15,346 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 280 transitions. [2021-01-07 04:30:15,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-07 04:30:15,347 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:15,348 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] [2021-01-07 04:30:15,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:15,562 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:15,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:15,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1107953786, now seen corresponding path program 2 times [2021-01-07 04:30:15,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:15,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232747488] [2021-01-07 04:30:15,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:15,584 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:15,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1676067933] [2021-01-07 04:30:15,585 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 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:30:15,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:30:15,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:30:15,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 04:30:15,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:16,153 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:30:16,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232747488] [2021-01-07 04:30:16,154 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:16,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676067933] [2021-01-07 04:30:16,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:30:16,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-01-07 04:30:16,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167378773] [2021-01-07 04:30:16,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 04:30:16,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:16,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 04:30:16,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:30:16,156 INFO L87 Difference]: Start difference. First operand 239 states and 280 transitions. Second operand 7 states. [2021-01-07 04:30:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:16,222 INFO L93 Difference]: Finished difference Result 425 states and 503 transitions. [2021-01-07 04:30:16,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 04:30:16,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2021-01-07 04:30:16,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:16,225 INFO L225 Difference]: With dead ends: 425 [2021-01-07 04:30:16,225 INFO L226 Difference]: Without dead ends: 241 [2021-01-07 04:30:16,226 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 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:30:16,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-01-07 04:30:16,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2021-01-07 04:30:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2021-01-07 04:30:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 282 transitions. [2021-01-07 04:30:16,237 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 282 transitions. Word has length 118 [2021-01-07 04:30:16,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:16,238 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 282 transitions. [2021-01-07 04:30:16,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 04:30:16,238 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 282 transitions. [2021-01-07 04:30:16,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-07 04:30:16,240 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:16,240 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] [2021-01-07 04:30:16,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-07 04:30:16,454 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:16,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:16,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1744266425, now seen corresponding path program 3 times [2021-01-07 04:30:16,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:16,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595453176] [2021-01-07 04:30:16,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:16,471 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:16,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1525161232] [2021-01-07 04:30:16,471 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 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