/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/seq-pthread/cs_stateful-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 21:33:36,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 21:33:36,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 21:33:36,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 21:33:36,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 21:33:36,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 21:33:36,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 21:33:36,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 21:33:36,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 21:33:36,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 21:33:36,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 21:33:36,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 21:33:36,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 21:33:36,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 21:33:36,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 21:33:36,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 21:33:36,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 21:33:36,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 21:33:36,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 21:33:36,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 21:33:36,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 21:33:36,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 21:33:36,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 21:33:36,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 21:33:36,359 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 21:33:36,360 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 21:33:36,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 21:33:36,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 21:33:36,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 21:33:36,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 21:33:36,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 21:33:36,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 21:33:36,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 21:33:36,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 21:33:36,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 21:33:36,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 21:33:36,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 21:33:36,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 21:33:36,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 21:33:36,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 21:33:36,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 21:33:36,375 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 21:33:36,426 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 21:33:36,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 21:33:36,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 21:33:36,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 21:33:36,432 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 21:33:36,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 21:33:36,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 21:33:36,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 21:33:36,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 21:33:36,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 21:33:36,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 21:33:36,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 21:33:36,435 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 21:33:36,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 21:33:36,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 21:33:36,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 21:33:36,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 21:33:36,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:33:36,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 21:33:36,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 21:33:36,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 21:33:36,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 21:33:36,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 21:33:36,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 21:33:36,438 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 21:33:36,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 21:33:36,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 21:33:36,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 21:33:36,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 21:33:36,950 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 21:33:36,953 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 21:33:36,955 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2021-01-06 21:33:37,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5dceea418/91378ba2ac214df584dacd4dea4226fa/FLAGd7fc79a1d [2021-01-06 21:33:37,881 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 21:33:37,882 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2021-01-06 21:33:37,912 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5dceea418/91378ba2ac214df584dacd4dea4226fa/FLAGd7fc79a1d [2021-01-06 21:33:38,103 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5dceea418/91378ba2ac214df584dacd4dea4226fa [2021-01-06 21:33:38,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 21:33:38,111 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 21:33:38,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 21:33:38,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 21:33:38,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 21:33:38,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:33:38" (1/1) ... [2021-01-06 21:33:38,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@558ed2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:33:38, skipping insertion in model container [2021-01-06 21:33:38,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:33:38" (1/1) ... [2021-01-06 21:33:38,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 21:33:38,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 21:33:38,555 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/seq-pthread/cs_stateful-1.i[23400,23413] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IdentifierExpression[~j~0,]]] left hand side expression in assignment: lhs: VariableLHS[~j~1,] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IdentifierExpression[~j~1,]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~id1,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread_allocated~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread_born_round~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: address: IdentifierExpression[~id1,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~data1~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~data2~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_cp___CS_thread_status~0,],[IdentifierExpression[~i~0,]]],[IdentifierExpression[~j~2,]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_cp___CS_thread_lockedon~0,],[IdentifierExpression[~i~0,]]],[IdentifierExpression[~j~2,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_cp_ma~0,],[IdentifierExpression[~i~0,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_cp_mb~0,],[IdentifierExpression[~i~0,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_cp_data1~0,],[IdentifierExpression[~i~0,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_cp_data2~0,],[IdentifierExpression[~i~0,]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~ma~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~mb~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~data1~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~data2~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_thread_index~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread_born_round~0,GLOBAL],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[0]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread~0,GLOBAL],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread_allocated~0,GLOBAL],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IntegerLiteral[2]]] [2021-01-06 21:33:38,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:33:38,781 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 21:33:38,820 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/seq-pthread/cs_stateful-1.i[23400,23413] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[24],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~j~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~j~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[24],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~j~1,]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[24],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],BinaryExpression[ARITHMUL,IntegerLiteral[8],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~id1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_allocated~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_allocated~0,GLOBAL],offset],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_born_round~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_born_round~0,GLOBAL],offset],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[3],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]]] left hand side expression in assignment: address: IdentifierExpression[~id1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#data1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#data1~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#data2~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#data2~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp___CS_thread_status~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp___CS_thread_status~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[3],IdentifierExpression[~i~0,]]],IdentifierExpression[~j~2,]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp___CS_thread_lockedon~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp___CS_thread_lockedon~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[24],IdentifierExpression[~i~0,]]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~j~2,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp_ma~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp_ma~0,],offset],IdentifierExpression[~i~0,]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp_mb~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp_mb~0,],offset],IdentifierExpression[~i~0,]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp_data1~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp_data1~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp_data2~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp_data2~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ma~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~#ma~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#mb~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~#mb~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#data1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#data1~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#data2~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#data2~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_thread_index~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_born_round~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~#__CS_thread_born_round~0,GLOBAL],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread~0,GLOBAL],[IntegerLiteral[0]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_allocated~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~#__CS_thread_allocated~0,GLOBAL],offset]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[3],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[3],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[3],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]]] [2021-01-06 21:33:38,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:33:39,040 INFO L208 MainTranslator]: Completed translation [2021-01-06 21:33:39,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:33:39 WrapperNode [2021-01-06 21:33:39,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 21:33:39,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 21:33:39,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 21:33:39,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 21:33:39,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:33:39" (1/1) ... [2021-01-06 21:33:39,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:33:39" (1/1) ... [2021-01-06 21:33:39,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 21:33:39,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 21:33:39,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 21:33:39,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 21:33:39,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:33:39" (1/1) ... [2021-01-06 21:33:39,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:33:39" (1/1) ... [2021-01-06 21:33:39,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:33:39" (1/1) ... [2021-01-06 21:33:39,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:33:39" (1/1) ... [2021-01-06 21:33:39,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:33:39" (1/1) ... [2021-01-06 21:33:39,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:33:39" (1/1) ... [2021-01-06 21:33:39,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:33:39" (1/1) ... [2021-01-06 21:33:39,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 21:33:39,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 21:33:39,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 21:33:39,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 21:33:39,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:33:39" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:33:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 21:33:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 21:33:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 21:33:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 21:33:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 21:33:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 21:33:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-06 21:33:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 21:33:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 21:33:39,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 21:33:39,923 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:33:39,924 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:33:39,973 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:33:39,974 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:33:39,998 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:33:39,999 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:33:44,421 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##706: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:33:44,421 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##707: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:33:44,422 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##713: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:33:44,422 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##714: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:33:44,422 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-10: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-01-06 21:33:44,422 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-10: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:33:44,422 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-11: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-01-06 21:33:44,423 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-11: assume !(0 != ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet5, __CS_cs_#t~nondet6, __CS_cs_#t~ite7, __CS_cs_~k~0;__CS_cs_~k~0 := __CS_cs_#t~nondet5;havoc __CS_cs_#t~nondet5; [2021-01-06 21:33:44,423 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-12: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-01-06 21:33:44,423 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-12: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:33:44,423 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-38: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-01-06 21:33:44,423 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-38: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:33:44,424 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-39: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-01-06 21:33:44,424 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-39: assume !(0 != ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet5, __CS_cs_#t~nondet6, __CS_cs_#t~ite7, __CS_cs_~k~0;__CS_cs_~k~0 := __CS_cs_#t~nondet5;havoc __CS_cs_#t~nondet5; [2021-01-06 21:33:44,424 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-40: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-01-06 21:33:44,424 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-40: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:33:44,424 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-66: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-01-06 21:33:44,424 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-66: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:33:44,425 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-67: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-01-06 21:33:44,425 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-67: assume !(0 != ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet5, __CS_cs_#t~nondet6, __CS_cs_#t~ite7, __CS_cs_~k~0;__CS_cs_~k~0 := __CS_cs_#t~nondet5;havoc __CS_cs_#t~nondet5; [2021-01-06 21:33:44,425 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-68: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-01-06 21:33:44,425 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-68: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:33:44,425 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-30: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:33:44,425 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-30: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2); [2021-01-06 21:33:44,426 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-32: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:33:44,426 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-30: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:33:44,426 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-30: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:33:44,426 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-32: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6; [2021-01-06 21:33:44,426 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-33: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:33:44,426 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-33: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:33:44,427 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-35: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6; [2021-01-06 21:33:44,427 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-36: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:33:44,427 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-36: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:33:44,427 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-38: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6; [2021-01-06 21:33:44,427 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-108: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:33:44,428 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-108: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2); [2021-01-06 21:33:44,428 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-110: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:33:44,428 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##419: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:33:44,428 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##418: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:33:44,428 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:33:44,429 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##425: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:33:44,429 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-114: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:33:44,429 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-114: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:33:44,429 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-116: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6; [2021-01-06 21:33:44,429 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-117: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:33:44,429 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-117: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:33:44,430 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-119: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6; [2021-01-06 21:33:44,430 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-120: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:33:44,430 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-120: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:33:44,430 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-122: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6; [2021-01-06 21:33:44,430 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-186: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:33:44,430 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-186: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2); [2021-01-06 21:33:44,431 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-188: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:33:44,431 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-198: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:33:44,431 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-198: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:33:44,431 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-200: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6; [2021-01-06 21:33:44,431 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-201: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:33:44,431 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-201: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:33:44,432 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-203: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6; [2021-01-06 21:33:44,432 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-204: assume 0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite7 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:33:44,432 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-204: assume !(0 != __CS_cs_#t~nondet6 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite7 := ~__CS_ret~0 % 256; [2021-01-06 21:33:44,432 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-206: ~__CS_ret~0 := __CS_cs_#t~ite7;havoc __CS_cs_#t~ite7;havoc __CS_cs_#t~nondet6; [2021-01-06 21:33:44,432 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##131: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:33:44,433 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:33:44,433 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2021-01-06 21:33:44,433 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;assume -2147483648 <= __CS_cs_#t~nondet6 && __CS_cs_#t~nondet6 <= 2147483647; [2021-01-06 21:33:44,460 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 21:33:44,460 INFO L299 CfgBuilder]: Removed 284 assume(true) statements. [2021-01-06 21:33:44,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:33:44 BoogieIcfgContainer [2021-01-06 21:33:44,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 21:33:44,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 21:33:44,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 21:33:44,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 21:33:44,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 09:33:38" (1/3) ... [2021-01-06 21:33:44,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de437e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:33:44, skipping insertion in model container [2021-01-06 21:33:44,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:33:39" (2/3) ... [2021-01-06 21:33:44,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de437e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:33:44, skipping insertion in model container [2021-01-06 21:33:44,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:33:44" (3/3) ... [2021-01-06 21:33:44,474 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_stateful-1.i [2021-01-06 21:33:44,481 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 21:33:44,490 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 21:33:44,510 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 21:33:44,549 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 21:33:44,549 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 21:33:44,549 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 21:33:44,549 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 21:33:44,549 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 21:33:44,549 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 21:33:44,550 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 21:33:44,550 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 21:33:44,587 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states. [2021-01-06 21:33:44,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-06 21:33:44,602 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:33:44,603 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] [2021-01-06 21:33:44,604 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:33:44,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:33:44,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1735824455, now seen corresponding path program 1 times [2021-01-06 21:33:44,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:33:44,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999255059] [2021-01-06 21:33:44,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:33:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:44,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:33:44,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999255059] [2021-01-06 21:33:44,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:33:44,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:33:44,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667816353] [2021-01-06 21:33:44,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:33:44,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:33:44,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:33:44,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:33:44,991 INFO L87 Difference]: Start difference. First operand 572 states. Second operand 3 states. [2021-01-06 21:33:45,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:33:45,171 INFO L93 Difference]: Finished difference Result 1147 states and 1785 transitions. [2021-01-06 21:33:45,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:33:45,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2021-01-06 21:33:45,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:33:45,221 INFO L225 Difference]: With dead ends: 1147 [2021-01-06 21:33:45,221 INFO L226 Difference]: Without dead ends: 573 [2021-01-06 21:33:45,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:33:45,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-01-06 21:33:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 569. [2021-01-06 21:33:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2021-01-06 21:33:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 792 transitions. [2021-01-06 21:33:45,369 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 792 transitions. Word has length 32 [2021-01-06 21:33:45,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:33:45,369 INFO L481 AbstractCegarLoop]: Abstraction has 569 states and 792 transitions. [2021-01-06 21:33:45,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:33:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 792 transitions. [2021-01-06 21:33:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 21:33:45,380 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:33:45,380 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] [2021-01-06 21:33:45,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 21:33:45,381 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:33:45,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:33:45,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1178330563, now seen corresponding path program 1 times [2021-01-06 21:33:45,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:33:45,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248684274] [2021-01-06 21:33:45,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:33:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:45,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:33:45,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248684274] [2021-01-06 21:33:45,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:33:45,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:33:45,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603058096] [2021-01-06 21:33:45,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:33:45,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:33:45,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:33:45,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:33:45,547 INFO L87 Difference]: Start difference. First operand 569 states and 792 transitions. Second operand 3 states. [2021-01-06 21:33:45,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:33:45,587 INFO L93 Difference]: Finished difference Result 1137 states and 1584 transitions. [2021-01-06 21:33:45,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:33:45,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2021-01-06 21:33:45,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:33:45,592 INFO L225 Difference]: With dead ends: 1137 [2021-01-06 21:33:45,592 INFO L226 Difference]: Without dead ends: 571 [2021-01-06 21:33:45,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:33:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-01-06 21:33:45,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 570. [2021-01-06 21:33:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2021-01-06 21:33:45,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 793 transitions. [2021-01-06 21:33:45,611 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 793 transitions. Word has length 36 [2021-01-06 21:33:45,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:33:45,611 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 793 transitions. [2021-01-06 21:33:45,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:33:45,611 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 793 transitions. [2021-01-06 21:33:45,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-06 21:33:45,613 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:33:45,613 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] [2021-01-06 21:33:45,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 21:33:45,614 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:33:45,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:33:45,614 INFO L82 PathProgramCache]: Analyzing trace with hash -240206341, now seen corresponding path program 1 times [2021-01-06 21:33:45,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:33:45,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614568277] [2021-01-06 21:33:45,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:33:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:33:45,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614568277] [2021-01-06 21:33:45,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206357312] [2021-01-06 21:33:45,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:33:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:45,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 21:33:45,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 21:33:46,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:33:46,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 21:33:46,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-06 21:33:46,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287162514] [2021-01-06 21:33:46,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:33:46,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:33:46,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:33:46,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:33:46,059 INFO L87 Difference]: Start difference. First operand 570 states and 793 transitions. Second operand 5 states. [2021-01-06 21:33:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:33:46,123 INFO L93 Difference]: Finished difference Result 1140 states and 1587 transitions. [2021-01-06 21:33:46,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:33:46,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2021-01-06 21:33:46,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:33:46,130 INFO L225 Difference]: With dead ends: 1140 [2021-01-06 21:33:46,131 INFO L226 Difference]: Without dead ends: 573 [2021-01-06 21:33:46,132 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:33:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-01-06 21:33:46,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 572. [2021-01-06 21:33:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2021-01-06 21:33:46,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 795 transitions. [2021-01-06 21:33:46,156 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 795 transitions. Word has length 38 [2021-01-06 21:33:46,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:33:46,157 INFO L481 AbstractCegarLoop]: Abstraction has 572 states and 795 transitions. [2021-01-06 21:33:46,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:33:46,157 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 795 transitions. [2021-01-06 21:33:46,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-06 21:33:46,161 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:33:46,162 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:33:46,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-06 21:33:46,378 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:33:46,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:33:46,379 INFO L82 PathProgramCache]: Analyzing trace with hash -645961159, now seen corresponding path program 2 times [2021-01-06 21:33:46,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:33:46,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608278215] [2021-01-06 21:33:46,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:33:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:46,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 21:33:46,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608278215] [2021-01-06 21:33:46,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534705074] [2021-01-06 21:33:46,571 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:33:46,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-06 21:33:46,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 21:33:46,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 21:33:46,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 21:33:46,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 21:33:46,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 21:33:46,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 21:33:46,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478735637] [2021-01-06 21:33:46,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:33:46,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:33:46,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:33:46,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:33:46,955 INFO L87 Difference]: Start difference. First operand 572 states and 795 transitions. Second operand 4 states. [2021-01-06 21:33:47,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:33:47,069 INFO L93 Difference]: Finished difference Result 1044 states and 1449 transitions. [2021-01-06 21:33:47,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:33:47,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2021-01-06 21:33:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:33:47,082 INFO L225 Difference]: With dead ends: 1044 [2021-01-06 21:33:47,082 INFO L226 Difference]: Without dead ends: 996 [2021-01-06 21:33:47,085 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:33:47,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2021-01-06 21:33:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 993. [2021-01-06 21:33:47,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2021-01-06 21:33:47,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1366 transitions. [2021-01-06 21:33:47,116 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1366 transitions. Word has length 40 [2021-01-06 21:33:47,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:33:47,120 INFO L481 AbstractCegarLoop]: Abstraction has 993 states and 1366 transitions. [2021-01-06 21:33:47,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:33:47,120 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1366 transitions. [2021-01-06 21:33:47,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 21:33:47,123 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:33:47,123 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 21:33:47,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:33:47,335 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:33:47,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:33:47,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1459437104, now seen corresponding path program 1 times [2021-01-06 21:33:47,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:33:47,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506199157] [2021-01-06 21:33:47,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:33:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 21:33:47,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506199157] [2021-01-06 21:33:47,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254942057] [2021-01-06 21:33:47,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:33:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:47,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 21:33:47,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 21:33:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:33:47,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 21:33:47,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2021-01-06 21:33:47,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382483848] [2021-01-06 21:33:47,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 21:33:47,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:33:47,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 21:33:47,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:33:47,723 INFO L87 Difference]: Start difference. First operand 993 states and 1366 transitions. Second operand 7 states. [2021-01-06 21:33:47,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:33:47,888 INFO L93 Difference]: Finished difference Result 1995 states and 2745 transitions. [2021-01-06 21:33:47,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 21:33:47,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2021-01-06 21:33:47,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:33:47,894 INFO L225 Difference]: With dead ends: 1995 [2021-01-06 21:33:47,894 INFO L226 Difference]: Without dead ends: 1005 [2021-01-06 21:33:47,896 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2021-01-06 21:33:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2021-01-06 21:33:47,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 1005. [2021-01-06 21:33:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states. [2021-01-06 21:33:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1379 transitions. [2021-01-06 21:33:47,921 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1379 transitions. Word has length 70 [2021-01-06 21:33:47,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:33:47,922 INFO L481 AbstractCegarLoop]: Abstraction has 1005 states and 1379 transitions. [2021-01-06 21:33:47,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 21:33:47,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1379 transitions. [2021-01-06 21:33:47,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 21:33:47,925 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:33:47,925 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:33:48,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:33:48,140 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:33:48,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:33:48,142 INFO L82 PathProgramCache]: Analyzing trace with hash 209416304, now seen corresponding path program 2 times [2021-01-06 21:33:48,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:33:48,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639870451] [2021-01-06 21:33:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:33:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:33:48,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639870451] [2021-01-06 21:33:48,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:33:48,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:33:48,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986510717] [2021-01-06 21:33:48,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:33:48,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:33:48,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:33:48,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:33:48,493 INFO L87 Difference]: Start difference. First operand 1005 states and 1379 transitions. Second operand 4 states. [2021-01-06 21:33:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:33:48,723 INFO L93 Difference]: Finished difference Result 2605 states and 3551 transitions. [2021-01-06 21:33:48,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:33:48,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2021-01-06 21:33:48,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:33:48,734 INFO L225 Difference]: With dead ends: 2605 [2021-01-06 21:33:48,735 INFO L226 Difference]: Without dead ends: 1812 [2021-01-06 21:33:48,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:33:48,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2021-01-06 21:33:48,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 932. [2021-01-06 21:33:48,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2021-01-06 21:33:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1277 transitions. [2021-01-06 21:33:48,777 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1277 transitions. Word has length 82 [2021-01-06 21:33:48,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:33:48,778 INFO L481 AbstractCegarLoop]: Abstraction has 932 states and 1277 transitions. [2021-01-06 21:33:48,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:33:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1277 transitions. [2021-01-06 21:33:48,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 21:33:48,781 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:33:48,781 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:33:48,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 21:33:48,782 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:33:48,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:33:48,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2136411760, now seen corresponding path program 1 times [2021-01-06 21:33:48,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:33:48,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316882551] [2021-01-06 21:33:48,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:33:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:33:48,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316882551] [2021-01-06 21:33:48,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:33:48,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:33:48,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457496109] [2021-01-06 21:33:48,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:33:48,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:33:48,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:33:48,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:33:48,958 INFO L87 Difference]: Start difference. First operand 932 states and 1277 transitions. Second operand 4 states. [2021-01-06 21:33:49,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:33:49,341 INFO L93 Difference]: Finished difference Result 2532 states and 3449 transitions. [2021-01-06 21:33:49,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:33:49,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2021-01-06 21:33:49,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:33:49,355 INFO L225 Difference]: With dead ends: 2532 [2021-01-06 21:33:49,355 INFO L226 Difference]: Without dead ends: 1738 [2021-01-06 21:33:49,361 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-06 21:33:49,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2021-01-06 21:33:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 858. [2021-01-06 21:33:49,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2021-01-06 21:33:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1174 transitions. [2021-01-06 21:33:49,396 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1174 transitions. Word has length 82 [2021-01-06 21:33:49,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:33:49,396 INFO L481 AbstractCegarLoop]: Abstraction has 858 states and 1174 transitions. [2021-01-06 21:33:49,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:33:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1174 transitions. [2021-01-06 21:33:49,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 21:33:49,399 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:33:49,399 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:33:49,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 21:33:49,401 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:33:49,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:33:49,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1762070388, now seen corresponding path program 1 times [2021-01-06 21:33:49,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:33:49,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870830683] [2021-01-06 21:33:49,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:33:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:33:49,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870830683] [2021-01-06 21:33:49,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:33:49,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:33:49,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182157943] [2021-01-06 21:33:49,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:33:49,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:33:49,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:33:49,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:33:49,605 INFO L87 Difference]: Start difference. First operand 858 states and 1174 transitions. Second operand 4 states. [2021-01-06 21:33:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:33:51,864 INFO L93 Difference]: Finished difference Result 2053 states and 2786 transitions. [2021-01-06 21:33:51,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:33:51,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2021-01-06 21:33:51,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:33:51,873 INFO L225 Difference]: With dead ends: 2053 [2021-01-06 21:33:51,873 INFO L226 Difference]: Without dead ends: 1439 [2021-01-06 21:33:51,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:33:51,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2021-01-06 21:33:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 956. [2021-01-06 21:33:51,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2021-01-06 21:33:51,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1313 transitions. [2021-01-06 21:33:51,909 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1313 transitions. Word has length 82 [2021-01-06 21:33:51,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:33:51,910 INFO L481 AbstractCegarLoop]: Abstraction has 956 states and 1313 transitions. [2021-01-06 21:33:51,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:33:51,910 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1313 transitions. [2021-01-06 21:33:51,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 21:33:51,912 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:33:51,912 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:33:51,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 21:33:51,913 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:33:51,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:33:51,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2050108788, now seen corresponding path program 1 times [2021-01-06 21:33:51,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:33:51,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936186680] [2021-01-06 21:33:51,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:33:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:54,677 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2021-01-06 21:33:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:33:54,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936186680] [2021-01-06 21:33:54,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:33:54,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:33:54,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562539377] [2021-01-06 21:33:54,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:33:54,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:33:54,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:33:54,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:33:54,979 INFO L87 Difference]: Start difference. First operand 956 states and 1313 transitions. Second operand 6 states. [2021-01-06 21:33:58,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:33:58,352 INFO L93 Difference]: Finished difference Result 1585 states and 2134 transitions. [2021-01-06 21:33:58,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 21:33:58,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2021-01-06 21:33:58,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:33:58,361 INFO L225 Difference]: With dead ends: 1585 [2021-01-06 21:33:58,361 INFO L226 Difference]: Without dead ends: 1147 [2021-01-06 21:33:58,363 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:33:58,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2021-01-06 21:33:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 962. [2021-01-06 21:33:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2021-01-06 21:33:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1320 transitions. [2021-01-06 21:33:58,397 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1320 transitions. Word has length 82 [2021-01-06 21:33:58,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:33:58,397 INFO L481 AbstractCegarLoop]: Abstraction has 962 states and 1320 transitions. [2021-01-06 21:33:58,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:33:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1320 transitions. [2021-01-06 21:33:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 21:33:58,399 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:33:58,400 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:33:58,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 21:33:58,400 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:33:58,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:33:58,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1339215096, now seen corresponding path program 1 times [2021-01-06 21:33:58,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:33:58,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387393212] [2021-01-06 21:33:58,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:33:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:33:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:33:58,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387393212] [2021-01-06 21:33:58,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:33:58,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:33:58,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507369918] [2021-01-06 21:33:58,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:33:58,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:33:58,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:33:58,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:33:58,595 INFO L87 Difference]: Start difference. First operand 962 states and 1320 transitions. Second operand 4 states. [2021-01-06 21:34:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:00,819 INFO L93 Difference]: Finished difference Result 1468 states and 1977 transitions. [2021-01-06 21:34:00,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:34:00,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2021-01-06 21:34:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:00,829 INFO L225 Difference]: With dead ends: 1468 [2021-01-06 21:34:00,829 INFO L226 Difference]: Without dead ends: 1204 [2021-01-06 21:34:00,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:34:00,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2021-01-06 21:34:00,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1068. [2021-01-06 21:34:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2021-01-06 21:34:00,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1465 transitions. [2021-01-06 21:34:00,885 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1465 transitions. Word has length 82 [2021-01-06 21:34:00,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:00,885 INFO L481 AbstractCegarLoop]: Abstraction has 1068 states and 1465 transitions. [2021-01-06 21:34:00,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:34:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1465 transitions. [2021-01-06 21:34:00,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 21:34:00,887 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:00,887 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:34:00,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 21:34:00,888 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:00,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:00,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1294822136, now seen corresponding path program 1 times [2021-01-06 21:34:00,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:00,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355603224] [2021-01-06 21:34:00,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:34:02,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355603224] [2021-01-06 21:34:02,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:02,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:34:02,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317298942] [2021-01-06 21:34:02,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:34:02,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:02,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:34:02,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:34:02,686 INFO L87 Difference]: Start difference. First operand 1068 states and 1465 transitions. Second operand 6 states. [2021-01-06 21:34:05,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:05,788 INFO L93 Difference]: Finished difference Result 1165 states and 1581 transitions. [2021-01-06 21:34:05,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 21:34:05,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2021-01-06 21:34:05,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:05,795 INFO L225 Difference]: With dead ends: 1165 [2021-01-06 21:34:05,795 INFO L226 Difference]: Without dead ends: 1062 [2021-01-06 21:34:05,796 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:34:05,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2021-01-06 21:34:05,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2021-01-06 21:34:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2021-01-06 21:34:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1452 transitions. [2021-01-06 21:34:05,834 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1452 transitions. Word has length 82 [2021-01-06 21:34:05,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:05,834 INFO L481 AbstractCegarLoop]: Abstraction has 1062 states and 1452 transitions. [2021-01-06 21:34:05,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:34:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1452 transitions. [2021-01-06 21:34:05,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 21:34:05,845 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:05,846 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:34:05,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 21:34:05,846 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:05,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:05,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1292701664, now seen corresponding path program 1 times [2021-01-06 21:34:05,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:05,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451338789] [2021-01-06 21:34:05,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:34:06,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451338789] [2021-01-06 21:34:06,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:06,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:34:06,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642447135] [2021-01-06 21:34:06,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:34:06,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:06,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:34:06,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:34:06,040 INFO L87 Difference]: Start difference. First operand 1062 states and 1452 transitions. Second operand 4 states. [2021-01-06 21:34:06,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:06,456 INFO L93 Difference]: Finished difference Result 2310 states and 3147 transitions. [2021-01-06 21:34:06,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:34:06,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2021-01-06 21:34:06,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:06,465 INFO L225 Difference]: With dead ends: 2310 [2021-01-06 21:34:06,466 INFO L226 Difference]: Without dead ends: 1309 [2021-01-06 21:34:06,470 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:34:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2021-01-06 21:34:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1109. [2021-01-06 21:34:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2021-01-06 21:34:06,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1507 transitions. [2021-01-06 21:34:06,520 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1507 transitions. Word has length 105 [2021-01-06 21:34:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:06,521 INFO L481 AbstractCegarLoop]: Abstraction has 1109 states and 1507 transitions. [2021-01-06 21:34:06,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:34:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1507 transitions. [2021-01-06 21:34:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 21:34:06,529 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:06,529 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:34:06,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 21:34:06,529 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:06,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:06,530 INFO L82 PathProgramCache]: Analyzing trace with hash -2108779294, now seen corresponding path program 1 times [2021-01-06 21:34:06,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:06,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829634277] [2021-01-06 21:34:06,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:10,148 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2021-01-06 21:34:10,308 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2021-01-06 21:34:10,486 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2021-01-06 21:34:10,665 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-01-06 21:34:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:34:10,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829634277] [2021-01-06 21:34:10,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:10,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 21:34:10,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008479860] [2021-01-06 21:34:10,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 21:34:10,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:10,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 21:34:10,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-01-06 21:34:10,853 INFO L87 Difference]: Start difference. First operand 1109 states and 1507 transitions. Second operand 11 states. [2021-01-06 21:34:22,299 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2021-01-06 21:34:22,555 WARN L197 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2021-01-06 21:34:22,927 WARN L197 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2021-01-06 21:34:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:27,671 INFO L93 Difference]: Finished difference Result 2183 states and 2976 transitions. [2021-01-06 21:34:27,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 21:34:27,672 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2021-01-06 21:34:27,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:27,682 INFO L225 Difference]: With dead ends: 2183 [2021-01-06 21:34:27,682 INFO L226 Difference]: Without dead ends: 1765 [2021-01-06 21:34:27,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2021-01-06 21:34:27,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2021-01-06 21:34:27,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1119. [2021-01-06 21:34:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2021-01-06 21:34:27,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1520 transitions. [2021-01-06 21:34:27,736 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1520 transitions. Word has length 105 [2021-01-06 21:34:27,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:27,737 INFO L481 AbstractCegarLoop]: Abstraction has 1119 states and 1520 transitions. [2021-01-06 21:34:27,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 21:34:27,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1520 transitions. [2021-01-06 21:34:27,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 21:34:27,740 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:27,740 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:34:27,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 21:34:27,741 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:27,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:27,741 INFO L82 PathProgramCache]: Analyzing trace with hash -169617248, now seen corresponding path program 1 times [2021-01-06 21:34:27,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:27,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409414640] [2021-01-06 21:34:27,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:34:31,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409414640] [2021-01-06 21:34:31,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:31,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:34:31,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292926627] [2021-01-06 21:34:31,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:34:31,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:31,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:34:31,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:34:31,229 INFO L87 Difference]: Start difference. First operand 1119 states and 1520 transitions. Second operand 5 states. [2021-01-06 21:34:33,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:33,033 INFO L93 Difference]: Finished difference Result 2772 states and 3729 transitions. [2021-01-06 21:34:33,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 21:34:33,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2021-01-06 21:34:33,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:33,043 INFO L225 Difference]: With dead ends: 2772 [2021-01-06 21:34:33,043 INFO L226 Difference]: Without dead ends: 1614 [2021-01-06 21:34:33,045 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:34:33,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2021-01-06 21:34:33,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1333. [2021-01-06 21:34:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2021-01-06 21:34:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1699 transitions. [2021-01-06 21:34:33,109 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1699 transitions. Word has length 105 [2021-01-06 21:34:33,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:33,109 INFO L481 AbstractCegarLoop]: Abstraction has 1333 states and 1699 transitions. [2021-01-06 21:34:33,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:34:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1699 transitions. [2021-01-06 21:34:33,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 21:34:33,113 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:33,113 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:34:33,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 21:34:33,113 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:33,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:33,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1012715608, now seen corresponding path program 1 times [2021-01-06 21:34:33,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:33,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278894841] [2021-01-06 21:34:33,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:33,998 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2021-01-06 21:34:34,163 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2021-01-06 21:34:34,324 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2021-01-06 21:34:34,480 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2021-01-06 21:34:34,692 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:34:34,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278894841] [2021-01-06 21:34:34,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:34,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 21:34:34,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458340030] [2021-01-06 21:34:34,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 21:34:34,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:34,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 21:34:34,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-01-06 21:34:34,694 INFO L87 Difference]: Start difference. First operand 1333 states and 1699 transitions. Second operand 13 states. [2021-01-06 21:34:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:42,774 INFO L93 Difference]: Finished difference Result 2563 states and 3270 transitions. [2021-01-06 21:34:42,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 21:34:42,774 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 105 [2021-01-06 21:34:42,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:42,783 INFO L225 Difference]: With dead ends: 2563 [2021-01-06 21:34:42,783 INFO L226 Difference]: Without dead ends: 2037 [2021-01-06 21:34:42,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2021-01-06 21:34:42,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2021-01-06 21:34:42,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 1333. [2021-01-06 21:34:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2021-01-06 21:34:42,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1698 transitions. [2021-01-06 21:34:42,875 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1698 transitions. Word has length 105 [2021-01-06 21:34:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:42,875 INFO L481 AbstractCegarLoop]: Abstraction has 1333 states and 1698 transitions. [2021-01-06 21:34:42,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 21:34:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1698 transitions. [2021-01-06 21:34:42,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-01-06 21:34:42,879 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:42,879 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:34:42,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 21:34:42,880 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:42,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:42,881 INFO L82 PathProgramCache]: Analyzing trace with hash 195260161, now seen corresponding path program 1 times [2021-01-06 21:34:42,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:42,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538974606] [2021-01-06 21:34:42,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:43,009 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:34:43,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538974606] [2021-01-06 21:34:43,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:43,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:34:43,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028424073] [2021-01-06 21:34:43,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:34:43,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:43,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:34:43,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:34:43,014 INFO L87 Difference]: Start difference. First operand 1333 states and 1698 transitions. Second operand 3 states. [2021-01-06 21:34:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:43,124 INFO L93 Difference]: Finished difference Result 2298 states and 2945 transitions. [2021-01-06 21:34:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:34:43,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2021-01-06 21:34:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:43,131 INFO L225 Difference]: With dead ends: 2298 [2021-01-06 21:34:43,131 INFO L226 Difference]: Without dead ends: 1344 [2021-01-06 21:34:43,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:34:43,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2021-01-06 21:34:43,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1344. [2021-01-06 21:34:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1344 states. [2021-01-06 21:34:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1709 transitions. [2021-01-06 21:34:43,192 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1709 transitions. Word has length 108 [2021-01-06 21:34:43,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:43,192 INFO L481 AbstractCegarLoop]: Abstraction has 1344 states and 1709 transitions. [2021-01-06 21:34:43,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:34:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1709 transitions. [2021-01-06 21:34:43,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-01-06 21:34:43,196 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:43,196 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:34:43,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 21:34:43,196 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:43,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:43,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1176547137, now seen corresponding path program 1 times [2021-01-06 21:34:43,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:43,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463276829] [2021-01-06 21:34:43,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:47,322 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2021-01-06 21:34:47,505 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2021-01-06 21:34:47,643 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2021-01-06 21:34:47,817 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2021-01-06 21:34:48,009 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2021-01-06 21:34:48,205 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2021-01-06 21:34:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:34:48,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463276829] [2021-01-06 21:34:48,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:48,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 21:34:48,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073421698] [2021-01-06 21:34:48,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 21:34:48,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:48,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 21:34:48,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-01-06 21:34:48,805 INFO L87 Difference]: Start difference. First operand 1344 states and 1709 transitions. Second operand 12 states. [2021-01-06 21:34:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:54,942 INFO L93 Difference]: Finished difference Result 2352 states and 2954 transitions. [2021-01-06 21:34:54,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 21:34:54,942 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2021-01-06 21:34:54,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:54,972 INFO L225 Difference]: With dead ends: 2352 [2021-01-06 21:34:54,973 INFO L226 Difference]: Without dead ends: 1910 [2021-01-06 21:34:54,975 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-01-06 21:34:54,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2021-01-06 21:34:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1344. [2021-01-06 21:34:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1344 states. [2021-01-06 21:34:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1706 transitions. [2021-01-06 21:34:55,041 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1706 transitions. Word has length 108 [2021-01-06 21:34:55,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:55,042 INFO L481 AbstractCegarLoop]: Abstraction has 1344 states and 1706 transitions. [2021-01-06 21:34:55,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 21:34:55,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1706 transitions. [2021-01-06 21:34:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 21:34:55,046 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:55,046 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:34:55,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 21:34:55,046 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:55,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:55,047 INFO L82 PathProgramCache]: Analyzing trace with hash -312688372, now seen corresponding path program 1 times [2021-01-06 21:34:55,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:55,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231319283] [2021-01-06 21:34:55,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:55,632 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:34:55,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231319283] [2021-01-06 21:34:55,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:55,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 21:34:55,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796863697] [2021-01-06 21:34:55,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 21:34:55,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:55,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 21:34:55,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:34:55,634 INFO L87 Difference]: Start difference. First operand 1344 states and 1706 transitions. Second operand 7 states. [2021-01-06 21:34:57,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:57,926 INFO L93 Difference]: Finished difference Result 2365 states and 2933 transitions. [2021-01-06 21:34:57,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 21:34:57,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2021-01-06 21:34:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:57,934 INFO L225 Difference]: With dead ends: 2365 [2021-01-06 21:34:57,934 INFO L226 Difference]: Without dead ends: 1668 [2021-01-06 21:34:57,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:34:57,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2021-01-06 21:34:57,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1098. [2021-01-06 21:34:57,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098 states. [2021-01-06 21:34:57,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1379 transitions. [2021-01-06 21:34:57,994 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1379 transitions. Word has length 118 [2021-01-06 21:34:57,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:57,994 INFO L481 AbstractCegarLoop]: Abstraction has 1098 states and 1379 transitions. [2021-01-06 21:34:57,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 21:34:57,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1379 transitions. [2021-01-06 21:34:57,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-01-06 21:34:57,997 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:57,997 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:34:57,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 21:34:57,998 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:57,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:57,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1270539736, now seen corresponding path program 1 times [2021-01-06 21:34:57,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:57,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017497099] [2021-01-06 21:34:57,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:34:58,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017497099] [2021-01-06 21:34:58,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:58,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 21:34:58,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404221567] [2021-01-06 21:34:58,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 21:34:58,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:58,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 21:34:58,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:34:58,631 INFO L87 Difference]: Start difference. First operand 1098 states and 1379 transitions. Second operand 7 states. [2021-01-06 21:35:01,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:35:01,056 INFO L93 Difference]: Finished difference Result 2008 states and 2473 transitions. [2021-01-06 21:35:01,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 21:35:01,056 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2021-01-06 21:35:01,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:35:01,061 INFO L225 Difference]: With dead ends: 2008 [2021-01-06 21:35:01,061 INFO L226 Difference]: Without dead ends: 1308 [2021-01-06 21:35:01,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:35:01,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2021-01-06 21:35:01,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 883. [2021-01-06 21:35:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2021-01-06 21:35:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1097 transitions. [2021-01-06 21:35:01,110 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1097 transitions. Word has length 119 [2021-01-06 21:35:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:35:01,111 INFO L481 AbstractCegarLoop]: Abstraction has 883 states and 1097 transitions. [2021-01-06 21:35:01,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 21:35:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1097 transitions. [2021-01-06 21:35:01,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-01-06 21:35:01,113 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:35:01,114 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:35:01,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 21:35:01,114 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:35:01,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:35:01,114 INFO L82 PathProgramCache]: Analyzing trace with hash -766922536, now seen corresponding path program 1 times [2021-01-06 21:35:01,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:35:01,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058324954] [2021-01-06 21:35:01,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:35:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:35:04,991 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:35:04,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058324954] [2021-01-06 21:35:04,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:35:04,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:35:04,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459564215] [2021-01-06 21:35:04,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:35:04,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:35:04,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:35:04,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:35:04,994 INFO L87 Difference]: Start difference. First operand 883 states and 1097 transitions. Second operand 10 states. [2021-01-06 21:35:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:35:08,082 INFO L93 Difference]: Finished difference Result 1065 states and 1307 transitions. [2021-01-06 21:35:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:35:08,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 119 [2021-01-06 21:35:08,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:35:08,087 INFO L225 Difference]: With dead ends: 1065 [2021-01-06 21:35:08,087 INFO L226 Difference]: Without dead ends: 1041 [2021-01-06 21:35:08,088 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-01-06 21:35:08,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2021-01-06 21:35:08,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 897. [2021-01-06 21:35:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2021-01-06 21:35:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1114 transitions. [2021-01-06 21:35:08,136 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1114 transitions. Word has length 119 [2021-01-06 21:35:08,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:35:08,136 INFO L481 AbstractCegarLoop]: Abstraction has 897 states and 1114 transitions. [2021-01-06 21:35:08,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:35:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1114 transitions. [2021-01-06 21:35:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 21:35:08,139 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:35:08,140 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:35:08,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 21:35:08,140 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:35:08,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:35:08,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1511829342, now seen corresponding path program 1 times [2021-01-06 21:35:08,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:35:08,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015994778] [2021-01-06 21:35:08,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:35:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:35:10,634 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:35:10,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015994778] [2021-01-06 21:35:10,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:35:10,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:35:10,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529849644] [2021-01-06 21:35:10,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:35:10,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:35:10,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:35:10,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:35:10,636 INFO L87 Difference]: Start difference. First operand 897 states and 1114 transitions. Second operand 6 states. [2021-01-06 21:35:12,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:35:12,148 INFO L93 Difference]: Finished difference Result 1875 states and 2323 transitions. [2021-01-06 21:35:12,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 21:35:12,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2021-01-06 21:35:12,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:35:12,154 INFO L225 Difference]: With dead ends: 1875 [2021-01-06 21:35:12,154 INFO L226 Difference]: Without dead ends: 1066 [2021-01-06 21:35:12,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:35:12,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2021-01-06 21:35:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 953. [2021-01-06 21:35:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2021-01-06 21:35:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1176 transitions. [2021-01-06 21:35:12,225 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1176 transitions. Word has length 121 [2021-01-06 21:35:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:35:12,225 INFO L481 AbstractCegarLoop]: Abstraction has 953 states and 1176 transitions. [2021-01-06 21:35:12,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:35:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1176 transitions. [2021-01-06 21:35:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 21:35:12,228 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:35:12,229 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:35:12,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 21:35:12,229 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:35:12,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:35:12,229 INFO L82 PathProgramCache]: Analyzing trace with hash 329550635, now seen corresponding path program 1 times [2021-01-06 21:35:12,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:35:12,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22941124] [2021-01-06 21:35:12,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:35:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:35:15,441 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:35:15,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22941124] [2021-01-06 21:35:15,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:35:15,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:35:15,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981185509] [2021-01-06 21:35:15,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:35:15,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:35:15,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:35:15,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:35:15,444 INFO L87 Difference]: Start difference. First operand 953 states and 1176 transitions. Second operand 4 states. [2021-01-06 21:35:16,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:35:16,643 INFO L93 Difference]: Finished difference Result 1833 states and 2245 transitions. [2021-01-06 21:35:16,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:35:16,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2021-01-06 21:35:16,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:35:16,648 INFO L225 Difference]: With dead ends: 1833 [2021-01-06 21:35:16,648 INFO L226 Difference]: Without dead ends: 1063 [2021-01-06 21:35:16,650 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:35:16,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2021-01-06 21:35:16,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1023. [2021-01-06 21:35:16,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2021-01-06 21:35:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1246 transitions. [2021-01-06 21:35:16,715 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1246 transitions. Word has length 122 [2021-01-06 21:35:16,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:35:16,715 INFO L481 AbstractCegarLoop]: Abstraction has 1023 states and 1246 transitions. [2021-01-06 21:35:16,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:35:16,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1246 transitions. [2021-01-06 21:35:16,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 21:35:16,718 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:35:16,719 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:35:16,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 21:35:16,719 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:35:16,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:35:16,720 INFO L82 PathProgramCache]: Analyzing trace with hash 952290027, now seen corresponding path program 1 times [2021-01-06 21:35:16,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:35:16,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092648317] [2021-01-06 21:35:16,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:35:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:35:26,127 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2021-01-06 21:35:26,549 WARN L197 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 103 [2021-01-06 21:35:27,088 WARN L197 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 118 [2021-01-06 21:35:27,611 WARN L197 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 118 [2021-01-06 21:35:28,151 WARN L197 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 112 [2021-01-06 21:35:28,619 WARN L197 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 112 [2021-01-06 21:35:29,127 WARN L197 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 95 [2021-01-06 21:35:29,694 WARN L197 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 102 [2021-01-06 21:35:30,636 WARN L197 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 117 [2021-01-06 21:35:31,255 WARN L197 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 109 [2021-01-06 21:35:32,176 WARN L197 SmtUtils]: Spent 819.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 111 [2021-01-06 21:35:32,927 WARN L197 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 124 [2021-01-06 21:35:33,688 WARN L197 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 124 [2021-01-06 21:35:34,154 WARN L197 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 96 [2021-01-06 21:35:34,683 WARN L197 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 102 [2021-01-06 21:35:35,162 WARN L197 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 92 [2021-01-06 21:35:35,790 WARN L197 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 92 [2021-01-06 21:35:36,158 WARN L197 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 88 [2021-01-06 21:35:36,534 WARN L197 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 81 [2021-01-06 21:35:36,914 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 71 [2021-01-06 21:35:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:35:37,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092648317] [2021-01-06 21:35:37,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:35:37,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-01-06 21:35:37,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295574437] [2021-01-06 21:35:37,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-01-06 21:35:37,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:35:37,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-01-06 21:35:37,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2021-01-06 21:35:37,772 INFO L87 Difference]: Start difference. First operand 1023 states and 1246 transitions. Second operand 25 states. [2021-01-06 21:35:38,148 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2021-01-06 21:35:54,605 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2021-01-06 21:35:54,921 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2021-01-06 21:35:55,800 WARN L197 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 154 [2021-01-06 21:35:56,198 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2021-01-06 21:35:57,374 WARN L197 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 132 [2021-01-06 21:35:57,905 WARN L197 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 109 [2021-01-06 21:35:58,472 WARN L197 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 108 [2021-01-06 21:35:59,141 WARN L197 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 127 [2021-01-06 21:35:59,948 WARN L197 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 119 [2021-01-06 21:36:00,698 WARN L197 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 120 [2021-01-06 21:36:01,781 WARN L197 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 131 [2021-01-06 21:36:02,614 WARN L197 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 138 [2021-01-06 21:36:03,341 WARN L197 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 141 [2021-01-06 21:36:04,065 WARN L197 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 135 [2021-01-06 21:36:04,806 WARN L197 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 134 [2021-01-06 21:36:05,811 WARN L197 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 146 [2021-01-06 21:36:06,911 WARN L197 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 155 [2021-01-06 21:36:07,864 WARN L197 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 147 [2021-01-06 21:36:08,713 WARN L197 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 129 [2021-01-06 21:36:13,917 WARN L197 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 147 [2021-01-06 21:36:14,563 WARN L197 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 148 [2021-01-06 21:36:17,007 WARN L197 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 154 [2021-01-06 21:36:17,332 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-01-06 21:36:18,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:36:18,514 INFO L93 Difference]: Finished difference Result 1492 states and 1771 transitions. [2021-01-06 21:36:18,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-01-06 21:36:18,515 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 122 [2021-01-06 21:36:18,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:36:18,517 INFO L225 Difference]: With dead ends: 1492 [2021-01-06 21:36:18,517 INFO L226 Difference]: Without dead ends: 1380 [2021-01-06 21:36:18,518 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=358, Invalid=1994, Unknown=0, NotChecked=0, Total=2352 [2021-01-06 21:36:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2021-01-06 21:36:18,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1206. [2021-01-06 21:36:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1206 states. [2021-01-06 21:36:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1460 transitions. [2021-01-06 21:36:18,639 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1460 transitions. Word has length 122 [2021-01-06 21:36:18,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:36:18,639 INFO L481 AbstractCegarLoop]: Abstraction has 1206 states and 1460 transitions. [2021-01-06 21:36:18,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-01-06 21:36:18,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1460 transitions. [2021-01-06 21:36:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 21:36:18,643 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:36:18,643 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:36:18,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 21:36:18,643 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:36:18,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:36:18,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1165010027, now seen corresponding path program 1 times [2021-01-06 21:36:18,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:36:18,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65174088] [2021-01-06 21:36:18,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:36:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:36:28,012 WARN L197 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2021-01-06 21:36:28,426 WARN L197 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 114 [2021-01-06 21:36:28,891 WARN L197 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 126 [2021-01-06 21:36:29,330 WARN L197 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 122 [2021-01-06 21:36:29,839 WARN L197 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 111 [2021-01-06 21:36:30,323 WARN L197 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 115 [2021-01-06 21:36:30,774 WARN L197 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 109 [2021-01-06 21:36:31,148 WARN L197 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 90 [2021-01-06 21:36:31,691 WARN L197 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 99 [2021-01-06 21:36:32,259 WARN L197 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 104 [2021-01-06 21:36:33,207 WARN L197 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 113 [2021-01-06 21:36:33,793 WARN L197 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 109 [2021-01-06 21:36:34,427 WARN L197 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 114 [2021-01-06 21:36:34,988 WARN L197 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 113 [2021-01-06 21:36:35,781 WARN L197 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 110 [2021-01-06 21:36:36,315 WARN L197 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 103 [2021-01-06 21:36:36,973 WARN L197 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 101 [2021-01-06 21:36:37,449 WARN L197 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 104 [2021-01-06 21:36:37,917 WARN L197 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 98 [2021-01-06 21:36:38,463 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 78 [2021-01-06 21:36:38,736 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2021-01-06 21:36:38,965 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2021-01-06 21:36:39,548 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:36:39,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65174088] [2021-01-06 21:36:39,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:36:39,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-01-06 21:36:39,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796526744] [2021-01-06 21:36:39,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-01-06 21:36:39,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:36:39,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-01-06 21:36:39,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2021-01-06 21:36:39,550 INFO L87 Difference]: Start difference. First operand 1206 states and 1460 transitions. Second operand 25 states. [2021-01-06 21:36:40,258 WARN L197 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 131 [2021-01-06 21:36:43,308 WARN L197 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-01-06 21:36:44,453 WARN L197 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 131 [2021-01-06 21:36:44,818 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2021-01-06 21:36:45,121 WARN L197 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2021-01-06 21:36:45,921 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2021-01-06 21:36:46,685 WARN L197 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 114 [2021-01-06 21:36:47,205 WARN L197 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 111 [2021-01-06 21:36:47,763 WARN L197 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 118 [2021-01-06 21:36:48,350 WARN L197 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 116 [2021-01-06 21:36:49,021 WARN L197 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 104 [2021-01-06 21:36:50,200 WARN L197 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 110 [2021-01-06 21:36:51,604 WARN L197 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 111 [2021-01-06 21:36:52,496 WARN L197 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 120 [2021-01-06 21:36:53,348 WARN L197 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 119 [2021-01-06 21:36:54,136 WARN L197 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 113 [2021-01-06 21:36:55,501 WARN L197 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 129 [2021-01-06 21:36:56,581 WARN L197 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 134 [2021-01-06 21:36:57,683 WARN L197 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 135 [2021-01-06 21:36:58,620 WARN L197 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 134 [2021-01-06 21:36:59,578 WARN L197 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 104 [2021-01-06 21:37:00,529 WARN L197 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 115 [2021-01-06 21:37:02,864 WARN L197 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 119 [2021-01-06 21:37:05,928 WARN L197 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 127 [2021-01-06 21:37:08,503 WARN L197 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 118 [2021-01-06 21:37:10,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:37:10,240 INFO L93 Difference]: Finished difference Result 1390 states and 1668 transitions. [2021-01-06 21:37:10,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-01-06 21:37:10,241 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 122 [2021-01-06 21:37:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:37:10,243 INFO L225 Difference]: With dead ends: 1390 [2021-01-06 21:37:10,243 INFO L226 Difference]: Without dead ends: 1254 [2021-01-06 21:37:10,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=337, Invalid=2113, Unknown=0, NotChecked=0, Total=2450 [2021-01-06 21:37:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2021-01-06 21:37:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1174. [2021-01-06 21:37:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2021-01-06 21:37:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1407 transitions. [2021-01-06 21:37:10,342 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1407 transitions. Word has length 122 [2021-01-06 21:37:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:37:10,342 INFO L481 AbstractCegarLoop]: Abstraction has 1174 states and 1407 transitions. [2021-01-06 21:37:10,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-01-06 21:37:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1407 transitions. [2021-01-06 21:37:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 21:37:10,346 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:37:10,346 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:37:10,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 21:37:10,346 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:37:10,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:37:10,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1981432932, now seen corresponding path program 1 times [2021-01-06 21:37:10,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:37:10,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119565827] [2021-01-06 21:37:10,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:37:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:37:14,087 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 34 [2021-01-06 21:37:14,228 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2021-01-06 21:37:14,362 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 30 [2021-01-06 21:37:14,497 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:37:14,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119565827] [2021-01-06 21:37:14,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:37:14,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 21:37:14,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415347009] [2021-01-06 21:37:14,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 21:37:14,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:37:14,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 21:37:14,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-01-06 21:37:14,501 INFO L87 Difference]: Start difference. First operand 1174 states and 1407 transitions. Second operand 12 states. [2021-01-06 21:37:18,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:37:18,984 INFO L93 Difference]: Finished difference Result 1494 states and 1767 transitions. [2021-01-06 21:37:18,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 21:37:18,985 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 127 [2021-01-06 21:37:18,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:37:18,989 INFO L225 Difference]: With dead ends: 1494 [2021-01-06 21:37:18,989 INFO L226 Difference]: Without dead ends: 1470 [2021-01-06 21:37:18,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-01-06 21:37:18,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2021-01-06 21:37:19,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1172. [2021-01-06 21:37:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2021-01-06 21:37:19,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1405 transitions. [2021-01-06 21:37:19,071 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1405 transitions. Word has length 127 [2021-01-06 21:37:19,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:37:19,071 INFO L481 AbstractCegarLoop]: Abstraction has 1172 states and 1405 transitions. [2021-01-06 21:37:19,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 21:37:19,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1405 transitions. [2021-01-06 21:37:19,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-01-06 21:37:19,074 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:37:19,075 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:37:19,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 21:37:19,075 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:37:19,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:37:19,076 INFO L82 PathProgramCache]: Analyzing trace with hash 146391285, now seen corresponding path program 1 times [2021-01-06 21:37:19,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:37:19,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161495019] [2021-01-06 21:37:19,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:37:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:37:22,956 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 19 [2021-01-06 21:37:23,081 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2021-01-06 21:37:23,206 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 22 [2021-01-06 21:37:23,339 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 23 [2021-01-06 21:37:23,493 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 27 [2021-01-06 21:37:23,706 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 33 [2021-01-06 21:37:23,881 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 29 [2021-01-06 21:37:24,043 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2021-01-06 21:37:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 21:37:24,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161495019] [2021-01-06 21:37:24,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:37:24,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 21:37:24,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674993244] [2021-01-06 21:37:24,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 21:37:24,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:37:24,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 21:37:24,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-01-06 21:37:24,308 INFO L87 Difference]: Start difference. First operand 1172 states and 1405 transitions. Second operand 12 states.