/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/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 14:59:31,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 14:59:31,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 14:59:32,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 14:59:32,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 14:59:32,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 14:59:32,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 14:59:32,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 14:59:32,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 14:59:32,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 14:59:32,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 14:59:32,084 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 14:59:32,084 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 14:59:32,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 14:59:32,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 14:59:32,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 14:59:32,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 14:59:32,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 14:59:32,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 14:59:32,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 14:59:32,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 14:59:32,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 14:59:32,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 14:59:32,130 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 14:59:32,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 14:59:32,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 14:59:32,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 14:59:32,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 14:59:32,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 14:59:32,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 14:59:32,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 14:59:32,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 14:59:32,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 14:59:32,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 14:59:32,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 14:59:32,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 14:59:32,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 14:59:32,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 14:59:32,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 14:59:32,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 14:59:32,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 14:59:32,166 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 14:59:32,213 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 14:59:32,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 14:59:32,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 14:59:32,218 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 14:59:32,218 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 14:59:32,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 14:59:32,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 14:59:32,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 14:59:32,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 14:59:32,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 14:59:32,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 14:59:32,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 14:59:32,221 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 14:59:32,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 14:59:32,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 14:59:32,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 14:59:32,222 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 14:59:32,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 14:59:32,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 14:59:32,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 14:59:32,223 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 14:59:32,223 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 14:59:32,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 14:59:32,224 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 14:59:32,224 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 14:59:32,224 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 14:59:32,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 14:59:32,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 14:59:32,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 14:59:32,668 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 14:59:32,669 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 14:59:32,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2020-12-23 14:59:32,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/dd8082564/c6a36d1022514d859b6d601ae456a87f/FLAGb74460e90 [2020-12-23 14:59:33,729 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 14:59:33,730 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2020-12-23 14:59:33,773 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/dd8082564/c6a36d1022514d859b6d601ae456a87f/FLAGb74460e90 [2020-12-23 14:59:34,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/dd8082564/c6a36d1022514d859b6d601ae456a87f [2020-12-23 14:59:34,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 14:59:34,214 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 14:59:34,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 14:59:34,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 14:59:34,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 14:59:34,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:59:34" (1/1) ... [2020-12-23 14:59:34,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18333e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:59:34, skipping insertion in model container [2020-12-23 14:59:34,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:59:34" (1/1) ... [2020-12-23 14:59:34,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 14:59:34,373 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] [2020-12-23 14:59:35,431 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/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i[159689,159702] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~__ret_warn_on~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~tx_urb~0,] left hand side expression in assignment: lhs: VariableLHS[~rx_urb~0,] left hand side expression in assignment: lhs: VariableLHS[~tx_buf~0,] left hand side expression in assignment: lhs: VariableLHS[~rx_buf~0,] left hand side expression in assignment: lhs: VariableLHS[~tx_urb~0,] left hand side expression in assignment: lhs: VariableLHS[~rx_urb~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~tx_buf~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~rx_buf~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iphone,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~iphone,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iphone,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~iphone,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iphone,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~iphone,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iphone,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~iphone,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~dev~0,] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem148,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[#t~mem148,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~len~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem158,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[260],StructAccessExpression[IdentifierExpression[#t~mem158,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~skb~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[134],StructAccessExpression[IdentifierExpression[~skb~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem166,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[212],StructAccessExpression[IdentifierExpression[#t~mem166,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[228],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~dev~1,] left hand side expression in assignment: lhs: VariableLHS[~udev~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~retval~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: lhs: VariableLHS[~dev~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~udev~1,] left hand side expression in assignment: lhs: VariableLHS[~net~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~retval~1,] left hand side expression in assignment: lhs: VariableLHS[~retval~1,] left hand side expression in assignment: lhs: VariableLHS[~__len~1,] left hand side expression in assignment: lhs: VariableLHS[~__ret~1,] left hand side expression in assignment: lhs: VariableLHS[~__ret~1,] left hand side expression in assignment: lhs: VariableLHS[~retval~1,] left hand side expression in assignment: lhs: VariableLHS[~udev~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem221,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[92],StructAccessExpression[IdentifierExpression[#t~mem221,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~retval~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~dev~3,] left hand side expression in assignment: lhs: VariableLHS[~udev~3,] left hand side expression in assignment: lhs: VariableLHS[~retval~3,] left hand side expression in assignment: lhs: VariableLHS[~retval~3,] left hand side expression in assignment: lhs: VariableLHS[~retval~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~dev~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~dev~5,] left hand side expression in assignment: lhs: VariableLHS[~udev~4,] left hand side expression in assignment: lhs: VariableLHS[~__ret_warn_on~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem248,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[268],StructAccessExpression[IdentifierExpression[#t~mem248,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__len~2,] left hand side expression in assignment: lhs: VariableLHS[~__ret~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem264,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[92],StructAccessExpression[IdentifierExpression[#t~mem264,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~retval~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem273,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[252],StructAccessExpression[IdentifierExpression[#t~mem273,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~dev~5,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem276,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[220],StructAccessExpression[IdentifierExpression[#t~mem276,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem279,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[236],StructAccessExpression[IdentifierExpression[#t~mem279,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~dev~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem288,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[252],StructAccessExpression[IdentifierExpression[#t~mem288,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~dev~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~udev~5,] left hand side expression in assignment: lhs: VariableLHS[~netdev~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[420],StructAccessExpression[IdentifierExpression[~netdev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[930],StructAccessExpression[IdentifierExpression[~netdev~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~dev~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~hintf~0,] left hand side expression in assignment: lhs: VariableLHS[~retval~5,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~endp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[73],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~retval~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~retval~5,] left hand side expression in assignment: lhs: VariableLHS[~retval~5,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~__constr_expr_0~0,],counter] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[74],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[98],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[182],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[190],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~retval~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1166],StructAccessExpression[IdentifierExpression[~netdev~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retval~5,] left hand side expression in assignment: lhs: VariableLHS[~retval~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~dev~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~ipheth_driver_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~ipheth_netdev_ops_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~31,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg2~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~32,] left hand side expression in assignment: lhs: VariableLHS[~tmp~33,] left hand side expression in assignment: lhs: VariableLHS[~tmp~34,] left hand side expression in assignment: lhs: VariableLHS[~tmp~35,] left hand side expression in assignment: lhs: VariableLHS[~tmp~36,] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~38,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~39,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_intfdata~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_intfdata~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~40,] left hand side expression in assignment: lhs: VariableLHS[~value~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~usb_urb~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_urb~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnInt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnIntCounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnBulk~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnBulkCounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~41,] left hand side expression in assignment: lhs: VariableLHS[~res~0,] left hand side expression in assignment: lhs: VariableLHS[~completeFnIntCounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnBulkCounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~42,] left hand side expression in assignment: lhs: VariableLHS[~result~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~43,] left hand side expression in assignment: lhs: VariableLHS[~dev_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_dev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~dev_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~dev_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_dev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~44,] left hand side expression in assignment: lhs: VariableLHS[~res~1,] left hand side expression in assignment: lhs: VariableLHS[~INTERF_STATE~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~INTERF_STATE~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~45,] left hand side expression in assignment: lhs: VariableLHS[~res~2,] left hand side expression in assignment: lhs: VariableLHS[~SERIAL_STATE~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~SERIAL_STATE~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~skb~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[229],StructAccessExpression[IdentifierExpression[~skb~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[237],StructAccessExpression[IdentifierExpression[~skb~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[221],StructAccessExpression[IdentifierExpression[~skb~1,],offset]]]] [2020-12-23 14:59:36,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 14:59:36,091 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] [2020-12-23 14:59:36,254 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/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i[159689,159702] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~__ret_warn_on~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~tx_urb~0,] left hand side expression in assignment: lhs: VariableLHS[~rx_urb~0,] left hand side expression in assignment: lhs: VariableLHS[~tx_buf~0,] left hand side expression in assignment: lhs: VariableLHS[~rx_buf~0,] left hand side expression in assignment: lhs: VariableLHS[~tx_urb~0,] left hand side expression in assignment: lhs: VariableLHS[~rx_urb~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~tx_buf~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~rx_buf~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iphone,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~iphone,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iphone,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~iphone,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iphone,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~iphone,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iphone,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~iphone,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~dev~0,] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem148,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[#t~mem148,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~len~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem158,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[260],StructAccessExpression[IdentifierExpression[#t~mem158,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~skb~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[134],StructAccessExpression[IdentifierExpression[~skb~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem166,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[212],StructAccessExpression[IdentifierExpression[#t~mem166,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[228],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~dev~1,] left hand side expression in assignment: lhs: VariableLHS[~udev~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~retval~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: lhs: VariableLHS[~dev~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~udev~1,] left hand side expression in assignment: lhs: VariableLHS[~net~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~retval~1,] left hand side expression in assignment: lhs: VariableLHS[~retval~1,] left hand side expression in assignment: lhs: VariableLHS[~__len~1,] left hand side expression in assignment: lhs: VariableLHS[~__ret~1,] left hand side expression in assignment: lhs: VariableLHS[~__ret~1,] left hand side expression in assignment: lhs: VariableLHS[~retval~1,] left hand side expression in assignment: lhs: VariableLHS[~udev~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem221,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[92],StructAccessExpression[IdentifierExpression[#t~mem221,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~retval~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~dev~3,] left hand side expression in assignment: lhs: VariableLHS[~udev~3,] left hand side expression in assignment: lhs: VariableLHS[~retval~3,] left hand side expression in assignment: lhs: VariableLHS[~retval~3,] left hand side expression in assignment: lhs: VariableLHS[~retval~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~dev~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~dev~5,] left hand side expression in assignment: lhs: VariableLHS[~udev~4,] left hand side expression in assignment: lhs: VariableLHS[~__ret_warn_on~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem248,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[268],StructAccessExpression[IdentifierExpression[#t~mem248,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__len~2,] left hand side expression in assignment: lhs: VariableLHS[~__ret~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem264,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[92],StructAccessExpression[IdentifierExpression[#t~mem264,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~retval~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem273,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[252],StructAccessExpression[IdentifierExpression[#t~mem273,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~dev~5,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem276,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[220],StructAccessExpression[IdentifierExpression[#t~mem276,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem279,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[236],StructAccessExpression[IdentifierExpression[#t~mem279,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~dev~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem288,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[252],StructAccessExpression[IdentifierExpression[#t~mem288,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~dev~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~udev~5,] left hand side expression in assignment: lhs: VariableLHS[~netdev~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[420],StructAccessExpression[IdentifierExpression[~netdev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[930],StructAccessExpression[IdentifierExpression[~netdev~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~dev~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~hintf~0,] left hand side expression in assignment: lhs: VariableLHS[~retval~5,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~endp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[73],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~retval~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~retval~5,] left hand side expression in assignment: lhs: VariableLHS[~retval~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[74],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[98],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[182],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[190],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~retval~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1166],StructAccessExpression[IdentifierExpression[~netdev~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retval~5,] left hand side expression in assignment: lhs: VariableLHS[~retval~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~dev~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~ipheth_driver_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~ipheth_netdev_ops_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~31,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg2~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~32,] left hand side expression in assignment: lhs: VariableLHS[~tmp~33,] left hand side expression in assignment: lhs: VariableLHS[~tmp~34,] left hand side expression in assignment: lhs: VariableLHS[~tmp~35,] left hand side expression in assignment: lhs: VariableLHS[~tmp~36,] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~38,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~39,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_intfdata~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_intfdata~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~40,] left hand side expression in assignment: lhs: VariableLHS[~value~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~usb_urb~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_urb~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnInt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnIntCounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnBulk~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnBulkCounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~41,] left hand side expression in assignment: lhs: VariableLHS[~res~0,] left hand side expression in assignment: lhs: VariableLHS[~completeFnIntCounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~completeFnBulkCounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~42,] left hand side expression in assignment: lhs: VariableLHS[~result~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~43,] left hand side expression in assignment: lhs: VariableLHS[~dev_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_dev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~dev_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~dev_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_dev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~44,] left hand side expression in assignment: lhs: VariableLHS[~res~1,] left hand side expression in assignment: lhs: VariableLHS[~INTERF_STATE~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~INTERF_STATE~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~45,] left hand side expression in assignment: lhs: VariableLHS[~res~2,] left hand side expression in assignment: lhs: VariableLHS[~SERIAL_STATE~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~SERIAL_STATE~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~skb~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[229],StructAccessExpression[IdentifierExpression[~skb~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[237],StructAccessExpression[IdentifierExpression[~skb~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[221],StructAccessExpression[IdentifierExpression[~skb~1,],offset]]]] [2020-12-23 14:59:36,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 14:59:36,772 INFO L208 MainTranslator]: Completed translation [2020-12-23 14:59:36,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:59:36 WrapperNode [2020-12-23 14:59:36,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 14:59:36,777 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 14:59:36,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 14:59:36,777 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 14:59:36,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:59:36" (1/1) ... [2020-12-23 14:59:36,841 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:59:36" (1/1) ... [2020-12-23 14:59:37,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 14:59:37,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 14:59:37,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 14:59:37,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 14:59:37,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:59:36" (1/1) ... [2020-12-23 14:59:37,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:59:36" (1/1) ... [2020-12-23 14:59:37,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:59:36" (1/1) ... [2020-12-23 14:59:37,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:59:36" (1/1) ... [2020-12-23 14:59:37,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:59:36" (1/1) ... [2020-12-23 14:59:37,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:59:36" (1/1) ... [2020-12-23 14:59:37,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:59:36" (1/1) ... [2020-12-23 14:59:37,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 14:59:37,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 14:59:37,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 14:59:37,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 14:59:37,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:59:36" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 14:59:37,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2020-12-23 14:59:37,442 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rx_submit [2020-12-23 14:59:37,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rx_submit [2020-12-23 14:59:37,442 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_9 [2020-12-23 14:59:37,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_9 [2020-12-23 14:59:37,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2020-12-23 14:59:37,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2020-12-23 14:59:37,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 14:59:37,443 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rcvbulk_callback [2020-12-23 14:59:37,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rcvbulk_callback [2020-12-23 14:59:37,443 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2020-12-23 14:59:37,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2020-12-23 14:59:37,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 14:59:37,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 14:59:37,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 14:59:37,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 14:59:37,444 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2020-12-23 14:59:37,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2020-12-23 14:59:37,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 14:59:37,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 14:59:37,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 14:59:37,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 14:59:37,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2020-12-23 14:59:37,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 14:59:37,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 14:59:40,958 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 14:59:40,959 INFO L299 CfgBuilder]: Removed 491 assume(true) statements. [2020-12-23 14:59:40,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:59:40 BoogieIcfgContainer [2020-12-23 14:59:40,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 14:59:40,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 14:59:40,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 14:59:40,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 14:59:40,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 02:59:34" (1/3) ... [2020-12-23 14:59:40,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c47162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:59:40, skipping insertion in model container [2020-12-23 14:59:40,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:59:36" (2/3) ... [2020-12-23 14:59:40,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c47162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:59:40, skipping insertion in model container [2020-12-23 14:59:40,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:59:40" (3/3) ... [2020-12-23 14:59:40,976 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2020-12-23 14:59:40,984 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 14:59:40,991 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-12-23 14:59:41,014 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-23 14:59:41,068 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 14:59:41,068 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 14:59:41,068 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 14:59:41,068 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 14:59:41,069 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 14:59:41,069 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 14:59:41,069 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 14:59:41,069 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 14:59:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states. [2020-12-23 14:59:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-23 14:59:41,117 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:59:41,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:59:41,119 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:59:41,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:59:41,126 INFO L82 PathProgramCache]: Analyzing trace with hash 729149926, now seen corresponding path program 1 times [2020-12-23 14:59:41,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:59:41,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349133494] [2020-12-23 14:59:41,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:59:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:59:41,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:59:41,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349133494] [2020-12-23 14:59:41,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:59:41,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:59:41,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139397587] [2020-12-23 14:59:41,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:59:41,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:59:41,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:59:41,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:41,796 INFO L87 Difference]: Start difference. First operand 453 states. Second operand 3 states. [2020-12-23 14:59:42,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:59:42,369 INFO L93 Difference]: Finished difference Result 1305 states and 1804 transitions. [2020-12-23 14:59:42,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:59:42,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-12-23 14:59:42,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:59:42,403 INFO L225 Difference]: With dead ends: 1305 [2020-12-23 14:59:42,404 INFO L226 Difference]: Without dead ends: 839 [2020-12-23 14:59:42,415 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:42,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2020-12-23 14:59:42,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2020-12-23 14:59:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2020-12-23 14:59:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1108 transitions. [2020-12-23 14:59:42,576 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1108 transitions. Word has length 19 [2020-12-23 14:59:42,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:59:42,576 INFO L481 AbstractCegarLoop]: Abstraction has 839 states and 1108 transitions. [2020-12-23 14:59:42,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:59:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1108 transitions. [2020-12-23 14:59:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-23 14:59:42,585 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:59:42,586 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] [2020-12-23 14:59:42,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 14:59:42,586 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:59:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:59:42,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1197836240, now seen corresponding path program 1 times [2020-12-23 14:59:42,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:59:42,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488862337] [2020-12-23 14:59:42,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:59:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:59:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:59:42,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488862337] [2020-12-23 14:59:42,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:59:42,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:59:42,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286157405] [2020-12-23 14:59:42,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:59:42,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:59:42,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:59:42,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:42,758 INFO L87 Difference]: Start difference. First operand 839 states and 1108 transitions. Second operand 3 states. [2020-12-23 14:59:42,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:59:42,829 INFO L93 Difference]: Finished difference Result 869 states and 1136 transitions. [2020-12-23 14:59:42,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:59:42,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-12-23 14:59:42,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:59:42,837 INFO L225 Difference]: With dead ends: 869 [2020-12-23 14:59:42,837 INFO L226 Difference]: Without dead ends: 854 [2020-12-23 14:59:42,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:42,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2020-12-23 14:59:42,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 839. [2020-12-23 14:59:42,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2020-12-23 14:59:42,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1107 transitions. [2020-12-23 14:59:42,926 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1107 transitions. Word has length 26 [2020-12-23 14:59:42,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:59:42,927 INFO L481 AbstractCegarLoop]: Abstraction has 839 states and 1107 transitions. [2020-12-23 14:59:42,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:59:42,927 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1107 transitions. [2020-12-23 14:59:42,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-23 14:59:42,930 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:59:42,931 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] [2020-12-23 14:59:42,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 14:59:42,932 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:59:42,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:59:42,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1197776658, now seen corresponding path program 1 times [2020-12-23 14:59:42,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:59:42,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637314650] [2020-12-23 14:59:42,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:59:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:59:43,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:59:43,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637314650] [2020-12-23 14:59:43,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:59:43,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 14:59:43,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105602252] [2020-12-23 14:59:43,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:59:43,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:59:43,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:59:43,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:43,222 INFO L87 Difference]: Start difference. First operand 839 states and 1107 transitions. Second operand 3 states. [2020-12-23 14:59:43,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:59:43,503 INFO L93 Difference]: Finished difference Result 2479 states and 3326 transitions. [2020-12-23 14:59:43,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:59:43,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-12-23 14:59:43,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:59:43,519 INFO L225 Difference]: With dead ends: 2479 [2020-12-23 14:59:43,519 INFO L226 Difference]: Without dead ends: 1658 [2020-12-23 14:59:43,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:43,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2020-12-23 14:59:43,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1646. [2020-12-23 14:59:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2020-12-23 14:59:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2180 transitions. [2020-12-23 14:59:43,624 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2180 transitions. Word has length 26 [2020-12-23 14:59:43,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:59:43,625 INFO L481 AbstractCegarLoop]: Abstraction has 1646 states and 2180 transitions. [2020-12-23 14:59:43,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:59:43,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2180 transitions. [2020-12-23 14:59:43,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 14:59:43,627 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:59:43,627 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] [2020-12-23 14:59:43,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 14:59:43,628 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:59:43,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:59:43,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1523628889, now seen corresponding path program 1 times [2020-12-23 14:59:43,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:59:43,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677066748] [2020-12-23 14:59:43,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:59:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:59:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:59:43,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677066748] [2020-12-23 14:59:43,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:59:43,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 14:59:43,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863644400] [2020-12-23 14:59:43,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:59:43,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:59:43,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:59:43,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:43,843 INFO L87 Difference]: Start difference. First operand 1646 states and 2180 transitions. Second operand 3 states. [2020-12-23 14:59:43,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:59:43,932 INFO L93 Difference]: Finished difference Result 1646 states and 2180 transitions. [2020-12-23 14:59:43,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:59:43,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-23 14:59:43,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:59:43,946 INFO L225 Difference]: With dead ends: 1646 [2020-12-23 14:59:43,946 INFO L226 Difference]: Without dead ends: 1644 [2020-12-23 14:59:43,948 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:43,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2020-12-23 14:59:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1644. [2020-12-23 14:59:44,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1644 states. [2020-12-23 14:59:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2178 transitions. [2020-12-23 14:59:44,061 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2178 transitions. Word has length 27 [2020-12-23 14:59:44,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:59:44,061 INFO L481 AbstractCegarLoop]: Abstraction has 1644 states and 2178 transitions. [2020-12-23 14:59:44,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:59:44,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2178 transitions. [2020-12-23 14:59:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 14:59:44,062 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:59:44,063 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] [2020-12-23 14:59:44,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 14:59:44,064 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:59:44,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:59:44,064 INFO L82 PathProgramCache]: Analyzing trace with hash -12145064, now seen corresponding path program 1 times [2020-12-23 14:59:44,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:59:44,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100868609] [2020-12-23 14:59:44,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:59:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:59:44,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:59:44,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100868609] [2020-12-23 14:59:44,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:59:44,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 14:59:44,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475308588] [2020-12-23 14:59:44,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:59:44,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:59:44,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:59:44,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:44,309 INFO L87 Difference]: Start difference. First operand 1644 states and 2178 transitions. Second operand 3 states. [2020-12-23 14:59:44,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:59:44,414 INFO L93 Difference]: Finished difference Result 1644 states and 2178 transitions. [2020-12-23 14:59:44,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:59:44,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-12-23 14:59:44,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:59:44,426 INFO L225 Difference]: With dead ends: 1644 [2020-12-23 14:59:44,426 INFO L226 Difference]: Without dead ends: 1642 [2020-12-23 14:59:44,428 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:44,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2020-12-23 14:59:44,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1642. [2020-12-23 14:59:44,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1642 states. [2020-12-23 14:59:44,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2176 transitions. [2020-12-23 14:59:44,552 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2176 transitions. Word has length 28 [2020-12-23 14:59:44,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:59:44,553 INFO L481 AbstractCegarLoop]: Abstraction has 1642 states and 2176 transitions. [2020-12-23 14:59:44,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:59:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2176 transitions. [2020-12-23 14:59:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 14:59:44,557 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:59:44,557 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] [2020-12-23 14:59:44,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 14:59:44,557 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:59:44,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:59:44,558 INFO L82 PathProgramCache]: Analyzing trace with hash -376497341, now seen corresponding path program 1 times [2020-12-23 14:59:44,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:59:44,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665146563] [2020-12-23 14:59:44,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:59:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:59:44,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:59:44,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665146563] [2020-12-23 14:59:44,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:59:44,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 14:59:44,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502402155] [2020-12-23 14:59:44,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:59:44,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:59:44,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:59:44,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:44,723 INFO L87 Difference]: Start difference. First operand 1642 states and 2176 transitions. Second operand 3 states. [2020-12-23 14:59:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:59:44,804 INFO L93 Difference]: Finished difference Result 1642 states and 2176 transitions. [2020-12-23 14:59:44,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:59:44,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-12-23 14:59:44,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:59:44,814 INFO L225 Difference]: With dead ends: 1642 [2020-12-23 14:59:44,814 INFO L226 Difference]: Without dead ends: 1640 [2020-12-23 14:59:44,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:44,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2020-12-23 14:59:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2020-12-23 14:59:44,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1640 states. [2020-12-23 14:59:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2174 transitions. [2020-12-23 14:59:44,907 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2174 transitions. Word has length 29 [2020-12-23 14:59:44,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:59:44,908 INFO L481 AbstractCegarLoop]: Abstraction has 1640 states and 2174 transitions. [2020-12-23 14:59:44,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:59:44,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2174 transitions. [2020-12-23 14:59:44,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 14:59:44,909 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:59:44,909 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] [2020-12-23 14:59:44,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 14:59:44,910 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:59:44,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:59:44,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1213483970, now seen corresponding path program 1 times [2020-12-23 14:59:44,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:59:44,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915219558] [2020-12-23 14:59:44,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:59:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:59:45,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:59:45,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915219558] [2020-12-23 14:59:45,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:59:45,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 14:59:45,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445390573] [2020-12-23 14:59:45,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:59:45,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:59:45,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:59:45,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:45,092 INFO L87 Difference]: Start difference. First operand 1640 states and 2174 transitions. Second operand 3 states. [2020-12-23 14:59:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:59:45,190 INFO L93 Difference]: Finished difference Result 1640 states and 2174 transitions. [2020-12-23 14:59:45,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:59:45,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-12-23 14:59:45,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:59:45,201 INFO L225 Difference]: With dead ends: 1640 [2020-12-23 14:59:45,201 INFO L226 Difference]: Without dead ends: 1631 [2020-12-23 14:59:45,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:45,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2020-12-23 14:59:45,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2020-12-23 14:59:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1631 states. [2020-12-23 14:59:45,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2163 transitions. [2020-12-23 14:59:45,314 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2163 transitions. Word has length 30 [2020-12-23 14:59:45,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:59:45,315 INFO L481 AbstractCegarLoop]: Abstraction has 1631 states and 2163 transitions. [2020-12-23 14:59:45,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:59:45,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2163 transitions. [2020-12-23 14:59:45,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-23 14:59:45,322 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:59:45,323 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:59:45,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 14:59:45,324 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:59:45,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:59:45,324 INFO L82 PathProgramCache]: Analyzing trace with hash -2139707916, now seen corresponding path program 1 times [2020-12-23 14:59:45,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:59:45,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042483507] [2020-12-23 14:59:45,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:59:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:59:45,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:59:45,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042483507] [2020-12-23 14:59:45,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:59:45,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:59:45,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534356821] [2020-12-23 14:59:45,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:59:45,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:59:45,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:59:45,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:45,503 INFO L87 Difference]: Start difference. First operand 1631 states and 2163 transitions. Second operand 3 states. [2020-12-23 14:59:45,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:59:45,710 INFO L93 Difference]: Finished difference Result 4178 states and 5567 transitions. [2020-12-23 14:59:45,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:59:45,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-12-23 14:59:45,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:59:45,728 INFO L225 Difference]: With dead ends: 4178 [2020-12-23 14:59:45,728 INFO L226 Difference]: Without dead ends: 2565 [2020-12-23 14:59:45,735 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:45,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2020-12-23 14:59:45,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 2557. [2020-12-23 14:59:45,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2557 states. [2020-12-23 14:59:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3414 transitions. [2020-12-23 14:59:45,966 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3414 transitions. Word has length 87 [2020-12-23 14:59:45,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:59:45,968 INFO L481 AbstractCegarLoop]: Abstraction has 2557 states and 3414 transitions. [2020-12-23 14:59:45,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:59:45,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3414 transitions. [2020-12-23 14:59:45,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-23 14:59:45,975 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:59:45,975 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:59:45,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 14:59:45,976 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:59:45,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:59:45,977 INFO L82 PathProgramCache]: Analyzing trace with hash -413485961, now seen corresponding path program 1 times [2020-12-23 14:59:45,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:59:45,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333575624] [2020-12-23 14:59:45,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:59:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:59:46,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 14:59:46,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333575624] [2020-12-23 14:59:46,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:59:46,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:59:46,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555231357] [2020-12-23 14:59:46,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:59:46,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:59:46,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:59:46,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:46,149 INFO L87 Difference]: Start difference. First operand 2557 states and 3414 transitions. Second operand 3 states. [2020-12-23 14:59:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:59:46,309 INFO L93 Difference]: Finished difference Result 5100 states and 6815 transitions. [2020-12-23 14:59:46,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:59:46,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2020-12-23 14:59:46,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:59:46,327 INFO L225 Difference]: With dead ends: 5100 [2020-12-23 14:59:46,327 INFO L226 Difference]: Without dead ends: 2561 [2020-12-23 14:59:46,335 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:46,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2020-12-23 14:59:46,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2561. [2020-12-23 14:59:46,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2561 states. [2020-12-23 14:59:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 3418 transitions. [2020-12-23 14:59:46,493 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 3418 transitions. Word has length 95 [2020-12-23 14:59:46,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:59:46,494 INFO L481 AbstractCegarLoop]: Abstraction has 2561 states and 3418 transitions. [2020-12-23 14:59:46,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:59:46,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 3418 transitions. [2020-12-23 14:59:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-23 14:59:46,502 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:59:46,503 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:59:46,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 14:59:46,503 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:59:46,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:59:46,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1514786741, now seen corresponding path program 1 times [2020-12-23 14:59:46,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:59:46,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118731663] [2020-12-23 14:59:46,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:59:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:59:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 14:59:46,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118731663] [2020-12-23 14:59:46,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:59:46,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:59:46,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588732439] [2020-12-23 14:59:46,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:59:46,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:59:46,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:59:46,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:59:46,843 INFO L87 Difference]: Start difference. First operand 2561 states and 3418 transitions. Second operand 5 states. [2020-12-23 14:59:47,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:59:47,334 INFO L93 Difference]: Finished difference Result 8529 states and 11530 transitions. [2020-12-23 14:59:47,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 14:59:47,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2020-12-23 14:59:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:59:47,370 INFO L225 Difference]: With dead ends: 8529 [2020-12-23 14:59:47,370 INFO L226 Difference]: Without dead ends: 5986 [2020-12-23 14:59:47,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:59:47,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5986 states. [2020-12-23 14:59:47,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5986 to 2573. [2020-12-23 14:59:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2573 states. [2020-12-23 14:59:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2573 states and 3430 transitions. [2020-12-23 14:59:47,720 INFO L78 Accepts]: Start accepts. Automaton has 2573 states and 3430 transitions. Word has length 95 [2020-12-23 14:59:47,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:59:47,721 INFO L481 AbstractCegarLoop]: Abstraction has 2573 states and 3430 transitions. [2020-12-23 14:59:47,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:59:47,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 3430 transitions. [2020-12-23 14:59:47,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 14:59:47,734 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:59:47,734 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:59:47,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 14:59:47,735 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:59:47,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:59:47,736 INFO L82 PathProgramCache]: Analyzing trace with hash -95826638, now seen corresponding path program 1 times [2020-12-23 14:59:47,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:59:47,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482685882] [2020-12-23 14:59:47,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:59:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:59:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 14:59:48,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482685882] [2020-12-23 14:59:48,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:59:48,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:59:48,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871797285] [2020-12-23 14:59:48,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:59:48,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:59:48,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:59:48,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:59:48,070 INFO L87 Difference]: Start difference. First operand 2573 states and 3430 transitions. Second operand 4 states. [2020-12-23 14:59:48,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:59:48,612 INFO L93 Difference]: Finished difference Result 6631 states and 8884 transitions. [2020-12-23 14:59:48,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:59:48,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2020-12-23 14:59:48,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:59:48,636 INFO L225 Difference]: With dead ends: 6631 [2020-12-23 14:59:48,636 INFO L226 Difference]: Without dead ends: 4068 [2020-12-23 14:59:48,645 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:59:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4068 states. [2020-12-23 14:59:48,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4068 to 2573. [2020-12-23 14:59:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2573 states. [2020-12-23 14:59:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2573 states and 3426 transitions. [2020-12-23 14:59:48,871 INFO L78 Accepts]: Start accepts. Automaton has 2573 states and 3426 transitions. Word has length 101 [2020-12-23 14:59:48,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:59:48,872 INFO L481 AbstractCegarLoop]: Abstraction has 2573 states and 3426 transitions. [2020-12-23 14:59:48,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:59:48,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 3426 transitions. [2020-12-23 14:59:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-23 14:59:48,878 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:59:48,878 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:59:48,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 14:59:48,878 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:59:48,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:59:48,879 INFO L82 PathProgramCache]: Analyzing trace with hash -684740018, now seen corresponding path program 1 times [2020-12-23 14:59:48,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:59:48,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239252551] [2020-12-23 14:59:48,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:59:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:59:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 14:59:49,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239252551] [2020-12-23 14:59:49,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:59:49,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:59:49,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272538775] [2020-12-23 14:59:49,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:59:49,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:59:49,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:59:49,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:59:49,195 INFO L87 Difference]: Start difference. First operand 2573 states and 3426 transitions. Second operand 5 states. [2020-12-23 14:59:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:59:49,808 INFO L93 Difference]: Finished difference Result 7694 states and 10341 transitions. [2020-12-23 14:59:49,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 14:59:49,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2020-12-23 14:59:49,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:59:49,838 INFO L225 Difference]: With dead ends: 7694 [2020-12-23 14:59:49,838 INFO L226 Difference]: Without dead ends: 5139 [2020-12-23 14:59:49,854 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:59:49,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5139 states. [2020-12-23 14:59:50,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5139 to 2585. [2020-12-23 14:59:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2585 states. [2020-12-23 14:59:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 3438 transitions. [2020-12-23 14:59:50,124 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 3438 transitions. Word has length 103 [2020-12-23 14:59:50,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:59:50,124 INFO L481 AbstractCegarLoop]: Abstraction has 2585 states and 3438 transitions. [2020-12-23 14:59:50,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:59:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3438 transitions. [2020-12-23 14:59:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 14:59:50,132 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:59:50,132 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:59:50,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 14:59:50,132 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:59:50,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:59:50,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1980304342, now seen corresponding path program 1 times [2020-12-23 14:59:50,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:59:50,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462023623] [2020-12-23 14:59:50,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:59:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:59:50,441 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 14:59:50,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462023623] [2020-12-23 14:59:50,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:59:50,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:59:50,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599226338] [2020-12-23 14:59:50,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:59:50,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:59:50,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:59:50,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:59:50,444 INFO L87 Difference]: Start difference. First operand 2585 states and 3438 transitions. Second operand 5 states. [2020-12-23 14:59:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:59:51,418 INFO L93 Difference]: Finished difference Result 9796 states and 13227 transitions. [2020-12-23 14:59:51,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 14:59:51,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2020-12-23 14:59:51,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:59:51,459 INFO L225 Difference]: With dead ends: 9796 [2020-12-23 14:59:51,460 INFO L226 Difference]: Without dead ends: 7229 [2020-12-23 14:59:51,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:59:51,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7229 states. [2020-12-23 14:59:51,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7229 to 2597. [2020-12-23 14:59:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2597 states. [2020-12-23 14:59:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 3450 transitions. [2020-12-23 14:59:51,804 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 3450 transitions. Word has length 105 [2020-12-23 14:59:51,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:59:51,804 INFO L481 AbstractCegarLoop]: Abstraction has 2597 states and 3450 transitions. [2020-12-23 14:59:51,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:59:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 3450 transitions. [2020-12-23 14:59:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 14:59:51,814 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:59:51,815 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:59:51,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 14:59:51,815 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:59:51,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:59:51,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1864851898, now seen corresponding path program 1 times [2020-12-23 14:59:51,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:59:51,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292688972] [2020-12-23 14:59:51,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:59:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:59:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 14:59:52,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292688972] [2020-12-23 14:59:52,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:59:52,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 14:59:52,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537886673] [2020-12-23 14:59:52,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 14:59:52,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:59:52,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 14:59:52,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 14:59:52,065 INFO L87 Difference]: Start difference. First operand 2597 states and 3450 transitions. Second operand 6 states. [2020-12-23 14:59:53,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:59:53,117 INFO L93 Difference]: Finished difference Result 8805 states and 11838 transitions. [2020-12-23 14:59:53,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 14:59:53,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2020-12-23 14:59:53,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:59:53,138 INFO L225 Difference]: With dead ends: 8805 [2020-12-23 14:59:53,138 INFO L226 Difference]: Without dead ends: 6226 [2020-12-23 14:59:53,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-23 14:59:53,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6226 states. [2020-12-23 14:59:53,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6226 to 2613. [2020-12-23 14:59:53,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2613 states. [2020-12-23 14:59:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2613 states and 3466 transitions. [2020-12-23 14:59:53,535 INFO L78 Accepts]: Start accepts. Automaton has 2613 states and 3466 transitions. Word has length 107 [2020-12-23 14:59:53,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:59:53,536 INFO L481 AbstractCegarLoop]: Abstraction has 2613 states and 3466 transitions. [2020-12-23 14:59:53,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 14:59:53,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2613 states and 3466 transitions. [2020-12-23 14:59:53,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-12-23 14:59:53,542 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:59:53,542 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:59:53,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 14:59:53,543 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:59:53,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:59:53,543 INFO L82 PathProgramCache]: Analyzing trace with hash -691380734, now seen corresponding path program 1 times [2020-12-23 14:59:53,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:59:53,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006814041] [2020-12-23 14:59:53,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:59:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:59:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 14:59:53,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006814041] [2020-12-23 14:59:53,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:59:53,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:59:53,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380787062] [2020-12-23 14:59:53,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:59:53,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:59:53,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:59:53,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:53,764 INFO L87 Difference]: Start difference. First operand 2613 states and 3466 transitions. Second operand 3 states. [2020-12-23 14:59:54,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:59:54,337 INFO L93 Difference]: Finished difference Result 6519 states and 8684 transitions. [2020-12-23 14:59:54,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:59:54,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2020-12-23 14:59:54,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:59:54,351 INFO L225 Difference]: With dead ends: 6519 [2020-12-23 14:59:54,351 INFO L226 Difference]: Without dead ends: 3924 [2020-12-23 14:59:54,360 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:54,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3924 states. [2020-12-23 14:59:54,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3924 to 2601. [2020-12-23 14:59:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2601 states. [2020-12-23 14:59:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2601 states and 3442 transitions. [2020-12-23 14:59:54,657 INFO L78 Accepts]: Start accepts. Automaton has 2601 states and 3442 transitions. Word has length 109 [2020-12-23 14:59:54,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:59:54,658 INFO L481 AbstractCegarLoop]: Abstraction has 2601 states and 3442 transitions. [2020-12-23 14:59:54,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:59:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 3442 transitions. [2020-12-23 14:59:54,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-12-23 14:59:54,664 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:59:54,664 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:59:54,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 14:59:54,665 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:59:54,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:59:54,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1209705982, now seen corresponding path program 1 times [2020-12-23 14:59:54,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:59:54,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804920541] [2020-12-23 14:59:54,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:59:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:59:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 14:59:54,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804920541] [2020-12-23 14:59:54,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:59:54,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:59:54,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676907052] [2020-12-23 14:59:54,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:59:54,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:59:54,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:59:54,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:59:54,937 INFO L87 Difference]: Start difference. First operand 2601 states and 3442 transitions. Second operand 4 states. [2020-12-23 14:59:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:59:56,206 INFO L93 Difference]: Finished difference Result 9205 states and 12302 transitions. [2020-12-23 14:59:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:59:56,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2020-12-23 14:59:56,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:59:56,227 INFO L225 Difference]: With dead ends: 9205 [2020-12-23 14:59:56,227 INFO L226 Difference]: Without dead ends: 6622 [2020-12-23 14:59:56,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:59:56,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6622 states. [2020-12-23 14:59:56,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6622 to 2633. [2020-12-23 14:59:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2633 states. [2020-12-23 14:59:56,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3482 transitions. [2020-12-23 14:59:56,599 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3482 transitions. Word has length 109 [2020-12-23 14:59:56,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:59:56,600 INFO L481 AbstractCegarLoop]: Abstraction has 2633 states and 3482 transitions. [2020-12-23 14:59:56,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:59:56,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3482 transitions. [2020-12-23 14:59:56,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 14:59:56,606 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:59:56,607 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:59:56,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 14:59:56,607 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:59:56,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:59:56,607 INFO L82 PathProgramCache]: Analyzing trace with hash -559598042, now seen corresponding path program 1 times [2020-12-23 14:59:56,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:59:56,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436268124] [2020-12-23 14:59:56,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:59:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:59:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 14:59:56,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436268124] [2020-12-23 14:59:56,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:59:56,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:59:56,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805954345] [2020-12-23 14:59:56,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:59:56,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:59:56,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:59:56,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:59:56,854 INFO L87 Difference]: Start difference. First operand 2633 states and 3482 transitions. Second operand 4 states. [2020-12-23 14:59:57,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:59:57,823 INFO L93 Difference]: Finished difference Result 6575 states and 8744 transitions. [2020-12-23 14:59:57,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:59:57,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2020-12-23 14:59:57,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:59:57,835 INFO L225 Difference]: With dead ends: 6575 [2020-12-23 14:59:57,835 INFO L226 Difference]: Without dead ends: 3960 [2020-12-23 14:59:57,844 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 [2020-12-23 14:59:57,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3960 states. [2020-12-23 14:59:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3960 to 2637. [2020-12-23 14:59:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2637 states. [2020-12-23 14:59:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 3486 transitions. [2020-12-23 14:59:58,185 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 3486 transitions. Word has length 111 [2020-12-23 14:59:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:59:58,185 INFO L481 AbstractCegarLoop]: Abstraction has 2637 states and 3486 transitions. [2020-12-23 14:59:58,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:59:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3486 transitions. [2020-12-23 14:59:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-12-23 14:59:58,191 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:59:58,191 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:59:58,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 14:59:58,192 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:59:58,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:59:58,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1932447274, now seen corresponding path program 1 times [2020-12-23 14:59:58,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:59:58,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248171685] [2020-12-23 14:59:58,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:59:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:59:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 14:59:58,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248171685] [2020-12-23 14:59:58,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876596895] [2020-12-23 14:59:58,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:59:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:59:59,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 2007 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 14:59:59,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:59:59,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 14:59:59,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 14:59:59,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-12-23 14:59:59,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428789675] [2020-12-23 14:59:59,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 14:59:59,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:59:59,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 14:59:59,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:59:59,265 INFO L87 Difference]: Start difference. First operand 2637 states and 3486 transitions. Second operand 7 states. [2020-12-23 15:00:00,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:00:00,951 INFO L93 Difference]: Finished difference Result 7214 states and 9595 transitions. [2020-12-23 15:00:00,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:00:00,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2020-12-23 15:00:00,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:00:00,966 INFO L225 Difference]: With dead ends: 7214 [2020-12-23 15:00:00,966 INFO L226 Difference]: Without dead ends: 4595 [2020-12-23 15:00:00,973 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:00:00,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4595 states. [2020-12-23 15:00:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4595 to 2657. [2020-12-23 15:00:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2657 states. [2020-12-23 15:00:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 3514 transitions. [2020-12-23 15:00:01,366 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 3514 transitions. Word has length 112 [2020-12-23 15:00:01,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:00:01,366 INFO L481 AbstractCegarLoop]: Abstraction has 2657 states and 3514 transitions. [2020-12-23 15:00:01,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 15:00:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3514 transitions. [2020-12-23 15:00:01,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-23 15:00:01,372 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:00:01,372 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:00:01,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 15:00:01,586 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:00:01,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:00:01,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1942200796, now seen corresponding path program 1 times [2020-12-23 15:00:01,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:00:01,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743423258] [2020-12-23 15:00:01,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:00:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:00:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:00:01,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743423258] [2020-12-23 15:00:01,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896910979] [2020-12-23 15:00:01,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:00:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:00:03,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 2017 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-23 15:00:03,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:00:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:00:03,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:00:03,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-12-23 15:00:03,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829586111] [2020-12-23 15:00:03,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 15:00:03,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:00:03,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 15:00:03,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:00:03,482 INFO L87 Difference]: Start difference. First operand 2657 states and 3514 transitions. Second operand 7 states. [2020-12-23 15:00:04,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:00:04,727 INFO L93 Difference]: Finished difference Result 6639 states and 8832 transitions. [2020-12-23 15:00:04,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:00:04,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2020-12-23 15:00:04,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:00:04,743 INFO L225 Difference]: With dead ends: 6639 [2020-12-23 15:00:04,744 INFO L226 Difference]: Without dead ends: 4000 [2020-12-23 15:00:04,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:00:04,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4000 states. [2020-12-23 15:00:05,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 2661. [2020-12-23 15:00:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2661 states. [2020-12-23 15:00:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 3518 transitions. [2020-12-23 15:00:05,130 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 3518 transitions. Word has length 113 [2020-12-23 15:00:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:00:05,131 INFO L481 AbstractCegarLoop]: Abstraction has 2661 states and 3518 transitions. [2020-12-23 15:00:05,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 15:00:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 3518 transitions. [2020-12-23 15:00:05,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-12-23 15:00:05,137 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:00:05,138 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-12-23 15:00:05,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:00:05,352 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:00:05,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:00:05,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1599614420, now seen corresponding path program 2 times [2020-12-23 15:00:05,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:00:05,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447737161] [2020-12-23 15:00:05,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:00:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:00:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:00:05,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447737161] [2020-12-23 15:00:05,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692651267] [2020-12-23 15:00:05,829 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:00:07,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 15:00:07,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:00:07,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 2057 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-23 15:00:07,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:00:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:00:07,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:00:07,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-12-23 15:00:07,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497336212] [2020-12-23 15:00:07,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 15:00:07,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:00:07,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 15:00:07,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:00:07,884 INFO L87 Difference]: Start difference. First operand 2661 states and 3518 transitions. Second operand 9 states. [2020-12-23 15:00:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:00:09,214 INFO L93 Difference]: Finished difference Result 6647 states and 8840 transitions. [2020-12-23 15:00:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 15:00:09,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2020-12-23 15:00:09,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:00:09,233 INFO L225 Difference]: With dead ends: 6647 [2020-12-23 15:00:09,233 INFO L226 Difference]: Without dead ends: 4004 [2020-12-23 15:00:09,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-12-23 15:00:09,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4004 states. [2020-12-23 15:00:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4004 to 2665. [2020-12-23 15:00:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2665 states. [2020-12-23 15:00:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 3522 transitions. [2020-12-23 15:00:09,598 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 3522 transitions. Word has length 114 [2020-12-23 15:00:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:00:09,598 INFO L481 AbstractCegarLoop]: Abstraction has 2665 states and 3522 transitions. [2020-12-23 15:00:09,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 15:00:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 3522 transitions. [2020-12-23 15:00:09,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-23 15:00:09,604 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:00:09,604 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:00:09,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:00:09,818 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:00:09,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:00:09,819 INFO L82 PathProgramCache]: Analyzing trace with hash -273263580, now seen corresponding path program 3 times [2020-12-23 15:00:09,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:00:09,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725509856] [2020-12-23 15:00:09,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:00:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:00:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:00:10,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725509856] [2020-12-23 15:00:10,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551967877] [2020-12-23 15:00:10,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:00:13,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 15:00:13,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:00:13,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 1851 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-23 15:00:13,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:00:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 15:00:13,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:00:13,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2020-12-23 15:00:13,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943068694] [2020-12-23 15:00:13,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 15:00:13,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:00:13,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 15:00:13,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-12-23 15:00:13,614 INFO L87 Difference]: Start difference. First operand 2665 states and 3522 transitions. Second operand 6 states. [2020-12-23 15:00:15,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:00:15,947 INFO L93 Difference]: Finished difference Result 8381 states and 11116 transitions. [2020-12-23 15:00:15,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 15:00:15,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2020-12-23 15:00:15,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:00:15,967 INFO L225 Difference]: With dead ends: 8381 [2020-12-23 15:00:15,967 INFO L226 Difference]: Without dead ends: 5734 [2020-12-23 15:00:15,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2020-12-23 15:00:15,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5734 states. [2020-12-23 15:00:16,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5734 to 2665. [2020-12-23 15:00:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2665 states. [2020-12-23 15:00:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 3520 transitions. [2020-12-23 15:00:16,473 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 3520 transitions. Word has length 115 [2020-12-23 15:00:16,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:00:16,474 INFO L481 AbstractCegarLoop]: Abstraction has 2665 states and 3520 transitions. [2020-12-23 15:00:16,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 15:00:16,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 3520 transitions. [2020-12-23 15:00:16,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-12-23 15:00:16,481 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:00:16,481 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:00:16,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:00:16,696 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:00:16,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:00:16,696 INFO L82 PathProgramCache]: Analyzing trace with hash 842472658, now seen corresponding path program 1 times [2020-12-23 15:00:16,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:00:16,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528621957] [2020-12-23 15:00:16,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:00:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:00:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 15:00:17,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528621957] [2020-12-23 15:00:17,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:00:17,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 15:00:17,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986484268] [2020-12-23 15:00:17,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 15:00:17,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:00:17,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 15:00:17,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:00:17,072 INFO L87 Difference]: Start difference. First operand 2665 states and 3520 transitions. Second operand 6 states. [2020-12-23 15:00:17,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:00:17,974 INFO L93 Difference]: Finished difference Result 6003 states and 7940 transitions. [2020-12-23 15:00:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 15:00:17,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2020-12-23 15:00:17,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:00:17,987 INFO L225 Difference]: With dead ends: 6003 [2020-12-23 15:00:17,987 INFO L226 Difference]: Without dead ends: 3356 [2020-12-23 15:00:17,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:00:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3356 states. [2020-12-23 15:00:18,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3356 to 2603. [2020-12-23 15:00:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2603 states. [2020-12-23 15:00:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 3438 transitions. [2020-12-23 15:00:18,542 INFO L78 Accepts]: Start accepts. Automaton has 2603 states and 3438 transitions. Word has length 125 [2020-12-23 15:00:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:00:18,542 INFO L481 AbstractCegarLoop]: Abstraction has 2603 states and 3438 transitions. [2020-12-23 15:00:18,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 15:00:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states and 3438 transitions. [2020-12-23 15:00:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-12-23 15:00:18,548 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:00:18,548 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:00:18,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 15:00:18,549 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:00:18,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:00:18,549 INFO L82 PathProgramCache]: Analyzing trace with hash -333677178, now seen corresponding path program 1 times [2020-12-23 15:00:18,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:00:18,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146043239] [2020-12-23 15:00:18,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:00:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:00:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:00:18,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146043239] [2020-12-23 15:00:18,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200664818] [2020-12-23 15:00:18,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:00:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:00:20,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 2168 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-23 15:00:20,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:00:21,012 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:00:21,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:00:21,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-12-23 15:00:21,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962198750] [2020-12-23 15:00:21,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 15:00:21,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:00:21,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 15:00:21,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-12-23 15:00:21,014 INFO L87 Difference]: Start difference. First operand 2603 states and 3438 transitions. Second operand 11 states. [2020-12-23 15:00:22,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:00:22,776 INFO L93 Difference]: Finished difference Result 6531 states and 8680 transitions. [2020-12-23 15:00:22,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 15:00:22,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 125 [2020-12-23 15:00:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:00:22,791 INFO L225 Difference]: With dead ends: 6531 [2020-12-23 15:00:22,791 INFO L226 Difference]: Without dead ends: 3946 [2020-12-23 15:00:22,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2020-12-23 15:00:22,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2020-12-23 15:00:23,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 2607. [2020-12-23 15:00:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2020-12-23 15:00:23,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 3442 transitions. [2020-12-23 15:00:23,246 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 3442 transitions. Word has length 125 [2020-12-23 15:00:23,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:00:23,247 INFO L481 AbstractCegarLoop]: Abstraction has 2607 states and 3442 transitions. [2020-12-23 15:00:23,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 15:00:23,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3442 transitions. [2020-12-23 15:00:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-12-23 15:00:23,253 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:00:23,253 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:00:23,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-12-23 15:00:23,468 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:00:23,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:00:23,469 INFO L82 PathProgramCache]: Analyzing trace with hash -619821770, now seen corresponding path program 2 times [2020-12-23 15:00:23,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:00:23,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832770294] [2020-12-23 15:00:23,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:00:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:00:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:00:23,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832770294] [2020-12-23 15:00:23,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840541141] [2020-12-23 15:00:23,813 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:00:26,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 15:00:26,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:00:26,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 2208 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-23 15:00:26,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:00:27,120 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:00:27,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:00:27,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-12-23 15:00:27,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710165905] [2020-12-23 15:00:27,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 15:00:27,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:00:27,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 15:00:27,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-12-23 15:00:27,123 INFO L87 Difference]: Start difference. First operand 2607 states and 3442 transitions. Second operand 13 states. [2020-12-23 15:00:29,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:00:29,446 INFO L93 Difference]: Finished difference Result 6539 states and 8688 transitions. [2020-12-23 15:00:29,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 15:00:29,453 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 126 [2020-12-23 15:00:29,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:00:29,465 INFO L225 Difference]: With dead ends: 6539 [2020-12-23 15:00:29,465 INFO L226 Difference]: Without dead ends: 3950 [2020-12-23 15:00:29,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2020-12-23 15:00:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3950 states. [2020-12-23 15:00:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3950 to 2611. [2020-12-23 15:00:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2611 states. [2020-12-23 15:00:29,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 3446 transitions. [2020-12-23 15:00:29,948 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 3446 transitions. Word has length 126 [2020-12-23 15:00:29,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:00:29,949 INFO L481 AbstractCegarLoop]: Abstraction has 2611 states and 3446 transitions. [2020-12-23 15:00:29,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 15:00:29,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3446 transitions. [2020-12-23 15:00:29,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-12-23 15:00:29,956 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:00:29,956 INFO L422 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:00:30,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:00:30,170 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:00:30,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:00:30,170 INFO L82 PathProgramCache]: Analyzing trace with hash -900369530, now seen corresponding path program 3 times [2020-12-23 15:00:30,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:00:30,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27197069] [2020-12-23 15:00:30,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:00:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:00:30,600 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:00:30,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27197069] [2020-12-23 15:00:30,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554694899] [2020-12-23 15:00:30,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:00:33,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 15:00:33,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:00:33,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 1922 conjuncts, 60 conjunts are in the unsatisfiable core [2020-12-23 15:00:33,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:00:34,256 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 15:00:34,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:00:34,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2020-12-23 15:00:34,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285166864] [2020-12-23 15:00:34,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 15:00:34,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:00:34,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 15:00:34,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2020-12-23 15:00:34,259 INFO L87 Difference]: Start difference. First operand 2611 states and 3446 transitions. Second operand 11 states. [2020-12-23 15:00:41,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:00:41,315 INFO L93 Difference]: Finished difference Result 15914 states and 21537 transitions. [2020-12-23 15:00:41,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2020-12-23 15:00:41,315 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 127 [2020-12-23 15:00:41,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:00:41,364 INFO L225 Difference]: With dead ends: 15914 [2020-12-23 15:00:41,365 INFO L226 Difference]: Without dead ends: 13255 [2020-12-23 15:00:41,378 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1419 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=970, Invalid=4142, Unknown=0, NotChecked=0, Total=5112 [2020-12-23 15:00:41,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13255 states. [2020-12-23 15:00:42,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13255 to 3898. [2020-12-23 15:00:42,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2020-12-23 15:00:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5119 transitions. [2020-12-23 15:00:42,177 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5119 transitions. Word has length 127 [2020-12-23 15:00:42,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:00:42,177 INFO L481 AbstractCegarLoop]: Abstraction has 3898 states and 5119 transitions. [2020-12-23 15:00:42,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 15:00:42,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5119 transitions. [2020-12-23 15:00:42,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-23 15:00:42,184 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:00:42,184 INFO L422 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:00:42,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-12-23 15:00:42,398 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:00:42,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:00:42,399 INFO L82 PathProgramCache]: Analyzing trace with hash 361274481, now seen corresponding path program 1 times [2020-12-23 15:00:42,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:00:42,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017675958] [2020-12-23 15:00:42,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:00:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:00:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:00:43,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017675958] [2020-12-23 15:00:43,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246755884] [2020-12-23 15:00:43,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:00:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:00:45,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 2274 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-23 15:00:45,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:00:45,494 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:00:45,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:00:45,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2020-12-23 15:00:45,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182983073] [2020-12-23 15:00:45,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 15:00:45,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:00:45,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 15:00:45,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2020-12-23 15:00:45,496 INFO L87 Difference]: Start difference. First operand 3898 states and 5119 transitions. Second operand 15 states. [2020-12-23 15:00:48,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:00:48,858 INFO L93 Difference]: Finished difference Result 9790 states and 12945 transitions. [2020-12-23 15:00:48,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 15:00:48,859 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 130 [2020-12-23 15:00:48,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:00:48,878 INFO L225 Difference]: With dead ends: 9790 [2020-12-23 15:00:48,878 INFO L226 Difference]: Without dead ends: 5910 [2020-12-23 15:00:48,886 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2020-12-23 15:00:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5910 states. [2020-12-23 15:00:49,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5910 to 3904. [2020-12-23 15:00:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3904 states. [2020-12-23 15:00:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3904 states to 3904 states and 5125 transitions. [2020-12-23 15:00:49,643 INFO L78 Accepts]: Start accepts. Automaton has 3904 states and 5125 transitions. Word has length 130 [2020-12-23 15:00:49,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:00:49,644 INFO L481 AbstractCegarLoop]: Abstraction has 3904 states and 5125 transitions. [2020-12-23 15:00:49,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 15:00:49,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 5125 transitions. [2020-12-23 15:00:49,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-23 15:00:49,649 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:00:49,649 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:00:49,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-12-23 15:00:49,863 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:00:49,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:00:49,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1779424575, now seen corresponding path program 2 times [2020-12-23 15:00:49,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:00:49,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346212980] [2020-12-23 15:00:49,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:00:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:00:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-23 15:00:50,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346212980] [2020-12-23 15:00:50,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:00:50,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 15:00:50,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824719501] [2020-12-23 15:00:50,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 15:00:50,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:00:50,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 15:00:50,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:00:50,988 INFO L87 Difference]: Start difference. First operand 3904 states and 5125 transitions. Second operand 9 states. [2020-12-23 15:00:56,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:00:56,952 INFO L93 Difference]: Finished difference Result 14141 states and 18790 transitions. [2020-12-23 15:00:56,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-12-23 15:00:56,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2020-12-23 15:00:56,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:00:56,980 INFO L225 Difference]: With dead ends: 14141 [2020-12-23 15:00:56,981 INFO L226 Difference]: Without dead ends: 10255 [2020-12-23 15:00:56,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=423, Invalid=1383, Unknown=0, NotChecked=0, Total=1806 [2020-12-23 15:00:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10255 states. [2020-12-23 15:00:57,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10255 to 3904. [2020-12-23 15:00:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3904 states. [2020-12-23 15:00:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3904 states to 3904 states and 5121 transitions. [2020-12-23 15:00:58,006 INFO L78 Accepts]: Start accepts. Automaton has 3904 states and 5121 transitions. Word has length 131 [2020-12-23 15:00:58,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:00:58,006 INFO L481 AbstractCegarLoop]: Abstraction has 3904 states and 5121 transitions. [2020-12-23 15:00:58,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 15:00:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 5121 transitions. [2020-12-23 15:00:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 15:00:58,011 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:00:58,012 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:00:58,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 15:00:58,012 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:00:58,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:00:58,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1695061800, now seen corresponding path program 1 times [2020-12-23 15:00:58,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:00:58,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593528848] [2020-12-23 15:00:58,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:00:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:00:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-23 15:00:58,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593528848] [2020-12-23 15:00:58,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:00:58,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:00:58,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798243875] [2020-12-23 15:00:58,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:00:58,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:00:58,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:00:58,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:00:58,211 INFO L87 Difference]: Start difference. First operand 3904 states and 5121 transitions. Second operand 4 states. [2020-12-23 15:01:00,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:01:00,013 INFO L93 Difference]: Finished difference Result 11948 states and 15913 transitions. [2020-12-23 15:01:00,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:01:00,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-12-23 15:01:00,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:01:00,036 INFO L225 Difference]: With dead ends: 11948 [2020-12-23 15:01:00,036 INFO L226 Difference]: Without dead ends: 8062 [2020-12-23 15:01:00,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:01:00,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8062 states. [2020-12-23 15:01:00,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8062 to 3908. [2020-12-23 15:01:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3908 states. [2020-12-23 15:01:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3908 states and 5125 transitions. [2020-12-23 15:01:00,882 INFO L78 Accepts]: Start accepts. Automaton has 3908 states and 5125 transitions. Word has length 133 [2020-12-23 15:01:00,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:01:00,883 INFO L481 AbstractCegarLoop]: Abstraction has 3908 states and 5125 transitions. [2020-12-23 15:01:00,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:01:00,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3908 states and 5125 transitions. [2020-12-23 15:01:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-12-23 15:01:00,889 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:01:00,889 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:01:00,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 15:01:00,889 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:01:00,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:01:00,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1704578182, now seen corresponding path program 1 times [2020-12-23 15:01:00,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:01:00,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909215665] [2020-12-23 15:01:00,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:01:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:01:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-23 15:01:01,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909215665] [2020-12-23 15:01:01,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:01:01,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:01:01,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633156767] [2020-12-23 15:01:01,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:01:01,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:01:01,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:01:01,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:01:01,077 INFO L87 Difference]: Start difference. First operand 3908 states and 5125 transitions. Second operand 4 states. [2020-12-23 15:01:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:01:02,923 INFO L93 Difference]: Finished difference Result 13292 states and 17545 transitions. [2020-12-23 15:01:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:01:02,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2020-12-23 15:01:02,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:01:02,945 INFO L225 Difference]: With dead ends: 13292 [2020-12-23 15:01:02,946 INFO L226 Difference]: Without dead ends: 9402 [2020-12-23 15:01:02,954 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:01:02,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9402 states. [2020-12-23 15:01:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9402 to 3920. [2020-12-23 15:01:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2020-12-23 15:01:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 5137 transitions. [2020-12-23 15:01:03,684 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 5137 transitions. Word has length 135 [2020-12-23 15:01:03,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:01:03,685 INFO L481 AbstractCegarLoop]: Abstraction has 3920 states and 5137 transitions. [2020-12-23 15:01:03,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:01:03,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 5137 transitions. [2020-12-23 15:01:03,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-12-23 15:01:03,691 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:01:03,691 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:01:03,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 15:01:03,691 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:01:03,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:01:03,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1003513604, now seen corresponding path program 1 times [2020-12-23 15:01:03,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:01:03,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303327044] [2020-12-23 15:01:03,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:01:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:01:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-23 15:01:04,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303327044] [2020-12-23 15:01:04,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913632125] [2020-12-23 15:01:04,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:01:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:01:04,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 2440 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:01:04,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:01:05,074 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-23 15:01:05,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:01:05,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2020-12-23 15:01:05,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285960808] [2020-12-23 15:01:05,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:01:05,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:01:05,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:01:05,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:01:05,076 INFO L87 Difference]: Start difference. First operand 3920 states and 5137 transitions. Second operand 4 states. [2020-12-23 15:01:07,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:01:07,277 INFO L93 Difference]: Finished difference Result 11725 states and 15369 transitions. [2020-12-23 15:01:07,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:01:07,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2020-12-23 15:01:07,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:01:07,370 INFO L225 Difference]: With dead ends: 11725 [2020-12-23 15:01:07,370 INFO L226 Difference]: Without dead ends: 11720 [2020-12-23 15:01:07,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:01:07,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11720 states. [2020-12-23 15:01:09,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11720 to 11564. [2020-12-23 15:01:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11564 states. [2020-12-23 15:01:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11564 states to 11564 states and 15199 transitions. [2020-12-23 15:01:09,530 INFO L78 Accepts]: Start accepts. Automaton has 11564 states and 15199 transitions. Word has length 135 [2020-12-23 15:01:09,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:01:09,530 INFO L481 AbstractCegarLoop]: Abstraction has 11564 states and 15199 transitions. [2020-12-23 15:01:09,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:01:09,531 INFO L276 IsEmpty]: Start isEmpty. Operand 11564 states and 15199 transitions. [2020-12-23 15:01:09,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-23 15:01:09,545 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:01:09,546 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:01:09,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:01:09,761 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:01:09,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:01:09,762 INFO L82 PathProgramCache]: Analyzing trace with hash 398694230, now seen corresponding path program 1 times [2020-12-23 15:01:09,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:01:09,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739958728] [2020-12-23 15:01:09,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:01:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:01:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-23 15:01:11,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739958728] [2020-12-23 15:01:11,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:01:11,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 15:01:11,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855431022] [2020-12-23 15:01:11,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 15:01:11,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:01:11,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 15:01:11,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-12-23 15:01:11,386 INFO L87 Difference]: Start difference. First operand 11564 states and 15199 transitions. Second operand 11 states. [2020-12-23 15:01:17,029 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2020-12-23 15:01:17,685 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2020-12-23 15:01:17,871 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2020-12-23 15:01:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:01:28,486 INFO L93 Difference]: Finished difference Result 46623 states and 62398 transitions. [2020-12-23 15:01:28,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2020-12-23 15:01:28,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 137 [2020-12-23 15:01:28,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:01:28,591 INFO L225 Difference]: With dead ends: 46623 [2020-12-23 15:01:28,592 INFO L226 Difference]: Without dead ends: 34999 [2020-12-23 15:01:28,622 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=862, Invalid=2920, Unknown=0, NotChecked=0, Total=3782 [2020-12-23 15:01:28,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34999 states. [2020-12-23 15:01:31,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34999 to 15333. [2020-12-23 15:01:31,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15333 states. [2020-12-23 15:01:31,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15333 states to 15333 states and 20088 transitions. [2020-12-23 15:01:31,835 INFO L78 Accepts]: Start accepts. Automaton has 15333 states and 20088 transitions. Word has length 137 [2020-12-23 15:01:31,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:01:31,836 INFO L481 AbstractCegarLoop]: Abstraction has 15333 states and 20088 transitions. [2020-12-23 15:01:31,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 15:01:31,836 INFO L276 IsEmpty]: Start isEmpty. Operand 15333 states and 20088 transitions. [2020-12-23 15:01:31,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-23 15:01:31,853 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:01:31,853 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-23 15:01:31,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 15:01:31,854 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:01:31,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:01:31,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2065265136, now seen corresponding path program 1 times [2020-12-23 15:01:31,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:01:31,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060509274] [2020-12-23 15:01:31,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:01:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:01:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-23 15:01:32,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060509274] [2020-12-23 15:01:32,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:01:32,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:01:32,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601892379] [2020-12-23 15:01:32,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:01:32,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:01:32,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:01:32,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:01:32,103 INFO L87 Difference]: Start difference. First operand 15333 states and 20088 transitions. Second operand 3 states. [2020-12-23 15:01:35,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:01:35,784 INFO L93 Difference]: Finished difference Result 30648 states and 40155 transitions. [2020-12-23 15:01:35,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:01:35,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2020-12-23 15:01:35,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:01:35,814 INFO L225 Difference]: With dead ends: 30648 [2020-12-23 15:01:35,814 INFO L226 Difference]: Without dead ends: 13230 [2020-12-23 15:01:35,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:01:35,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13230 states. [2020-12-23 15:01:38,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13230 to 13230. [2020-12-23 15:01:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13230 states. [2020-12-23 15:01:38,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13230 states to 13230 states and 17214 transitions. [2020-12-23 15:01:38,665 INFO L78 Accepts]: Start accepts. Automaton has 13230 states and 17214 transitions. Word has length 142 [2020-12-23 15:01:38,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:01:38,666 INFO L481 AbstractCegarLoop]: Abstraction has 13230 states and 17214 transitions. [2020-12-23 15:01:38,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:01:38,666 INFO L276 IsEmpty]: Start isEmpty. Operand 13230 states and 17214 transitions. [2020-12-23 15:01:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-23 15:01:38,676 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:01:38,677 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-23 15:01:38,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 15:01:38,677 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:01:38,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:01:38,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1137066958, now seen corresponding path program 1 times [2020-12-23 15:01:38,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:01:38,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68926497] [2020-12-23 15:01:38,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:01:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:01:38,787 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-23 15:01:38,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68926497] [2020-12-23 15:01:38,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:01:38,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:01:38,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958371396] [2020-12-23 15:01:38,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:01:38,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:01:38,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:01:38,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:01:38,793 INFO L87 Difference]: Start difference. First operand 13230 states and 17214 transitions. Second operand 3 states. [2020-12-23 15:01:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:01:40,601 INFO L93 Difference]: Finished difference Result 19458 states and 25293 transitions. [2020-12-23 15:01:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:01:40,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2020-12-23 15:01:40,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:01:40,620 INFO L225 Difference]: With dead ends: 19458 [2020-12-23 15:01:40,620 INFO L226 Difference]: Without dead ends: 6243 [2020-12-23 15:01:40,637 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:01:40,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6243 states. [2020-12-23 15:01:41,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6243 to 6243. [2020-12-23 15:01:41,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6243 states. [2020-12-23 15:01:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6243 states to 6243 states and 8094 transitions. [2020-12-23 15:01:41,851 INFO L78 Accepts]: Start accepts. Automaton has 6243 states and 8094 transitions. Word has length 142 [2020-12-23 15:01:41,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:01:41,851 INFO L481 AbstractCegarLoop]: Abstraction has 6243 states and 8094 transitions. [2020-12-23 15:01:41,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:01:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 6243 states and 8094 transitions. [2020-12-23 15:01:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-12-23 15:01:41,858 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:01:41,859 INFO L422 BasicCegarLoop]: trace histogram [6, 4, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:01:41,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 15:01:41,859 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:01:41,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:01:41,860 INFO L82 PathProgramCache]: Analyzing trace with hash -71100869, now seen corresponding path program 1 times [2020-12-23 15:01:41,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:01:41,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495957898] [2020-12-23 15:01:41,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:01:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:01:41,971 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-23 15:01:41,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495957898] [2020-12-23 15:01:41,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:01:41,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:01:41,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815668899] [2020-12-23 15:01:41,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:01:41,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:01:41,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:01:41,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:01:41,974 INFO L87 Difference]: Start difference. First operand 6243 states and 8094 transitions. Second operand 3 states. [2020-12-23 15:01:44,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:01:44,584 INFO L93 Difference]: Finished difference Result 14611 states and 19074 transitions. [2020-12-23 15:01:44,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:01:44,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2020-12-23 15:01:44,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:01:44,612 INFO L225 Difference]: With dead ends: 14611 [2020-12-23 15:01:44,612 INFO L226 Difference]: Without dead ends: 9120 [2020-12-23 15:01:44,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:01:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9120 states. [2020-12-23 15:01:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9120 to 9119. [2020-12-23 15:01:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9119 states. [2020-12-23 15:01:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9119 states to 9119 states and 11938 transitions. [2020-12-23 15:01:46,413 INFO L78 Accepts]: Start accepts. Automaton has 9119 states and 11938 transitions. Word has length 147 [2020-12-23 15:01:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:01:46,413 INFO L481 AbstractCegarLoop]: Abstraction has 9119 states and 11938 transitions. [2020-12-23 15:01:46,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:01:46,413 INFO L276 IsEmpty]: Start isEmpty. Operand 9119 states and 11938 transitions. [2020-12-23 15:01:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-12-23 15:01:46,420 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:01:46,420 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:01:46,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 15:01:46,420 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:01:46,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:01:46,421 INFO L82 PathProgramCache]: Analyzing trace with hash 227066871, now seen corresponding path program 1 times [2020-12-23 15:01:46,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:01:46,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491009815] [2020-12-23 15:01:46,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:01:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:01:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-23 15:01:46,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491009815] [2020-12-23 15:01:46,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:01:46,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 15:01:46,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478838180] [2020-12-23 15:01:46,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:01:46,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:01:46,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:01:46,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:01:46,703 INFO L87 Difference]: Start difference. First operand 9119 states and 11938 transitions. Second operand 5 states. [2020-12-23 15:01:54,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:01:54,979 INFO L93 Difference]: Finished difference Result 37589 states and 49999 transitions. [2020-12-23 15:01:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 15:01:54,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2020-12-23 15:01:54,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:01:55,029 INFO L225 Difference]: With dead ends: 37589 [2020-12-23 15:01:55,029 INFO L226 Difference]: Without dead ends: 29222 [2020-12-23 15:01:55,043 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:01:55,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29222 states. [2020-12-23 15:01:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29222 to 9137. [2020-12-23 15:01:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9137 states. [2020-12-23 15:01:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9137 states to 9137 states and 11956 transitions. [2020-12-23 15:01:57,091 INFO L78 Accepts]: Start accepts. Automaton has 9137 states and 11956 transitions. Word has length 147 [2020-12-23 15:01:57,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:01:57,092 INFO L481 AbstractCegarLoop]: Abstraction has 9137 states and 11956 transitions. [2020-12-23 15:01:57,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:01:57,092 INFO L276 IsEmpty]: Start isEmpty. Operand 9137 states and 11956 transitions. [2020-12-23 15:01:57,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-12-23 15:01:57,100 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:01:57,100 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:01:57,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 15:01:57,100 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:01:57,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:01:57,101 INFO L82 PathProgramCache]: Analyzing trace with hash -658321445, now seen corresponding path program 1 times [2020-12-23 15:01:57,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:01:57,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319411389] [2020-12-23 15:01:57,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:01:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:01:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-23 15:01:57,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319411389] [2020-12-23 15:01:57,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:01:57,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 15:01:57,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131743182] [2020-12-23 15:01:57,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:01:57,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:01:57,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:01:57,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:01:57,385 INFO L87 Difference]: Start difference. First operand 9137 states and 11956 transitions. Second operand 5 states. [2020-12-23 15:02:04,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:02:04,747 INFO L93 Difference]: Finished difference Result 33033 states and 43788 transitions. [2020-12-23 15:02:04,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 15:02:04,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2020-12-23 15:02:04,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:02:04,797 INFO L225 Difference]: With dead ends: 33033 [2020-12-23 15:02:04,797 INFO L226 Difference]: Without dead ends: 24648 [2020-12-23 15:02:04,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:02:04,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24648 states. [2020-12-23 15:02:06,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24648 to 9155. [2020-12-23 15:02:06,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9155 states. [2020-12-23 15:02:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9155 states to 9155 states and 11974 transitions. [2020-12-23 15:02:06,904 INFO L78 Accepts]: Start accepts. Automaton has 9155 states and 11974 transitions. Word has length 149 [2020-12-23 15:02:06,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:02:06,905 INFO L481 AbstractCegarLoop]: Abstraction has 9155 states and 11974 transitions. [2020-12-23 15:02:06,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:02:06,905 INFO L276 IsEmpty]: Start isEmpty. Operand 9155 states and 11974 transitions. [2020-12-23 15:02:06,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-12-23 15:02:06,911 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:02:06,911 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:02:06,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 15:02:06,911 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:02:06,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:02:06,912 INFO L82 PathProgramCache]: Analyzing trace with hash -46669281, now seen corresponding path program 1 times [2020-12-23 15:02:06,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:02:06,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942324909] [2020-12-23 15:02:06,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:02:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:02:07,975 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-23 15:02:07,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942324909] [2020-12-23 15:02:07,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:02:07,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 15:02:07,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788665284] [2020-12-23 15:02:07,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 15:02:07,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:02:07,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 15:02:07,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:02:07,980 INFO L87 Difference]: Start difference. First operand 9155 states and 11974 transitions. Second operand 9 states. [2020-12-23 15:02:14,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:02:14,634 INFO L93 Difference]: Finished difference Result 19179 states and 25235 transitions. [2020-12-23 15:02:14,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 15:02:14,635 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2020-12-23 15:02:14,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:02:14,654 INFO L225 Difference]: With dead ends: 19179 [2020-12-23 15:02:14,654 INFO L226 Difference]: Without dead ends: 10776 [2020-12-23 15:02:14,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2020-12-23 15:02:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10776 states. [2020-12-23 15:02:16,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10776 to 9929. [2020-12-23 15:02:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9929 states. [2020-12-23 15:02:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9929 states to 9929 states and 13059 transitions. [2020-12-23 15:02:16,922 INFO L78 Accepts]: Start accepts. Automaton has 9929 states and 13059 transitions. Word has length 151 [2020-12-23 15:02:16,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:02:16,922 INFO L481 AbstractCegarLoop]: Abstraction has 9929 states and 13059 transitions. [2020-12-23 15:02:16,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 15:02:16,923 INFO L276 IsEmpty]: Start isEmpty. Operand 9929 states and 13059 transitions. [2020-12-23 15:02:16,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-12-23 15:02:16,930 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:02:16,930 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:02:16,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-23 15:02:16,930 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:02:16,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:02:16,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1429419044, now seen corresponding path program 1 times [2020-12-23 15:02:16,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:02:16,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935077951] [2020-12-23 15:02:16,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:02:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:02:18,415 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-23 15:02:18,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935077951] [2020-12-23 15:02:18,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470032953] [2020-12-23 15:02:18,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:02:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:02:42,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 2647 conjuncts, 111 conjunts are in the unsatisfiable core [2020-12-23 15:02:42,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:02:43,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 15:02:43,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 15:02:43,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 15:02:43,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 15:02:43,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 15:02:43,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 15:02:43,512 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2020-12-23 15:02:43,514 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 15:02:43,566 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 15:02:43,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 15:02:43,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 15:02:43,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 15:02:43,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 15:02:43,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 15:02:43,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 15:02:43,584 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2020-12-23 15:02:43,586 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 15:02:43,623 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 15:02:43,630 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 15:02:43,630 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:71, output treesize:33 [2020-12-23 15:02:43,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 15:02:43,726 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-12-23 15:02:43,728 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 15:02:43,748 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 15:02:43,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 15:02:43,755 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-12-23 15:02:43,757 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 15:02:43,775 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 15:02:43,778 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 15:02:43,778 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:25 [2020-12-23 15:02:43,930 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-12-23 15:02:43,931 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 15:02:43,946 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 15:02:43,950 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-12-23 15:02:43,952 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 15:02:43,962 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 15:02:43,965 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 15:02:43,965 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:10 [2020-12-23 15:02:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-23 15:02:44,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:02:44,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [9] total 29 [2020-12-23 15:02:44,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384711881] [2020-12-23 15:02:44,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-23 15:02:44,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:02:44,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-23 15:02:44,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2020-12-23 15:02:44,164 INFO L87 Difference]: Start difference. First operand 9929 states and 13059 transitions. Second operand 21 states. [2020-12-23 15:02:55,339 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-12-23 15:02:55,852 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-12-23 15:02:56,138 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 66