/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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 14:20:00,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 14:20:00,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 14:20:00,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 14:20:00,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 14:20:00,224 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 14:20:00,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 14:20:00,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 14:20:00,241 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 14:20:00,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 14:20:00,255 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 14:20:00,257 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 14:20:00,257 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 14:20:00,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 14:20:00,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 14:20:00,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 14:20:00,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 14:20:00,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 14:20:00,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 14:20:00,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 14:20:00,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 14:20:00,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 14:20:00,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 14:20:00,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 14:20:00,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 14:20:00,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 14:20:00,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 14:20:00,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 14:20:00,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 14:20:00,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 14:20:00,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 14:20:00,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 14:20:00,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 14:20:00,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 14:20:00,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 14:20:00,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 14:20:00,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 14:20:00,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 14:20:00,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 14:20:00,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 14:20:00,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 14:20:00,337 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:20:00,368 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 14:20:00,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 14:20:00,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 14:20:00,370 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 14:20:00,371 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 14:20:00,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 14:20:00,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 14:20:00,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 14:20:00,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 14:20:00,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 14:20:00,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 14:20:00,373 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 14:20:00,373 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 14:20:00,373 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 14:20:00,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 14:20:00,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 14:20:00,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 14:20:00,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 14:20:00,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 14:20:00,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 14:20:00,375 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 14:20:00,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 14:20:00,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 14:20:00,376 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 14:20:00,377 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 14:20:00,377 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:20:00,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 14:20:00,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 14:20:00,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 14:20:00,892 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 14:20:00,893 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 14:20:00,894 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2020-12-23 14:20:00,994 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b40d4ad50/cc7d3979ced24b2f9e0b841ffe9d2208/FLAGf10e2e2d5 [2020-12-23 14:20:02,223 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 14:20:02,224 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2020-12-23 14:20:02,276 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b40d4ad50/cc7d3979ced24b2f9e0b841ffe9d2208/FLAGf10e2e2d5 [2020-12-23 14:20:02,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b40d4ad50/cc7d3979ced24b2f9e0b841ffe9d2208 [2020-12-23 14:20:02,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 14:20:02,653 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 14:20:02,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 14:20:02,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 14:20:02,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 14:20:02,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:20:02" (1/1) ... [2020-12-23 14:20:02,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5873266c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:20:02, skipping insertion in model container [2020-12-23 14:20:02,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:20:02" (1/1) ... [2020-12-23 14:20:02,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 14:20:02,802 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~v,],base],StructAccessExpression[IdentifierExpression[~v,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] -----Light side constant value:false left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: lhs: VariableLHS[~__ret_warn_on~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~8,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~9,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[124],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[172],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[124],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[172],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[156],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[156],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[156],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[148],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~cf~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[244],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~dev~0,] left hand side expression in assignment: lhs: VariableLHS[~netdev~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~11,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[838],StructAccessExpression[IdentifierExpression[~dev~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~stats~0,] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~1,],base],StructAccessExpression[IdentifierExpression[~cf~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~__min1~0,] left hand side expression in assignment: lhs: VariableLHS[~__min2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~12,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cf~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~1,],base],StructAccessExpression[IdentifierExpression[~cf~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~1,],base],StructAccessExpression[IdentifierExpression[~cf~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~1,],base],StructAccessExpression[IdentifierExpression[~cf~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~1,],base],StructAccessExpression[IdentifierExpression[~cf~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~1,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~cf~1,],offset]],IdentifierExpression[~i~0,]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~0,],base],StructAccessExpression[IdentifierExpression[~stats~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~stats~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~stats~1,] left hand side expression in assignment: lhs: VariableLHS[~skb~1,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~2,],base],StructAccessExpression[IdentifierExpression[~cf~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ecc~0,] left hand side expression in assignment: lhs: VariableLHS[~txerr~0,] left hand side expression in assignment: lhs: VariableLHS[~rxerr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],StructAccessExpression[IdentifierExpression[~dev,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~stats~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~2,],base],StructAccessExpression[IdentifierExpression[~cf~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~cf~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~cf~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~cf~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~cf~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~cf~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~cf~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~cf~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~cf~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~2,],base],StructAccessExpression[IdentifierExpression[~cf~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~cf~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~stats~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~stats~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~1,],base],StructAccessExpression[IdentifierExpression[~stats~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~stats~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~dev~1,] left hand side expression in assignment: lhs: VariableLHS[~netdev~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~13,] left hand side expression in assignment: lhs: VariableLHS[~ibuf~0,] left hand side expression in assignment: lhs: VariableLHS[~msg_count~0,] left hand side expression in assignment: lhs: VariableLHS[~again~0,] left hand side expression in assignment: lhs: VariableLHS[~start~0,] left hand side expression in assignment: lhs: VariableLHS[~msg~0,] left hand side expression in assignment: lhs: VariableLHS[~start~0,] left hand side expression in assignment: lhs: VariableLHS[~msg_count~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~4,] left hand side expression in assignment: lhs: VariableLHS[~retval~0,] left hand side expression in assignment: lhs: VariableLHS[~context~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~14,] left hand side expression in assignment: lhs: VariableLHS[~dev~2,] left hand side expression in assignment: lhs: VariableLHS[~netdev~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[908],StructAccessExpression[IdentifierExpression[~netdev~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[196],StructAccessExpression[IdentifierExpression[~netdev~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[212],StructAccessExpression[IdentifierExpression[~netdev~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~context~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~context~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[854],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~16,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~cmd~0,],type] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~cmd~0,],length] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~cmd~0,],msgid] left hand side expression in assignment: lhs: ArrayLHS[StructLHS[StructLHS[VariableLHS[~cmd~0,],msg],generic],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~17,] left hand side expression in assignment: lhs: VariableLHS[~netdev~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem176,],base],StructAccessExpression[IdentifierExpression[#t~mem176,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[838],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~urb~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~urb~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~18,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[92],StructAccessExpression[IdentifierExpression[~urb~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[520],StructAccessExpression[IdentifierExpression[~dev,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[13],IdentifierExpression[~i~2,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~19,] left hand side expression in assignment: lhs: VariableLHS[~dev~3,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[252],StructAccessExpression[IdentifierExpression[~dev~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~20,] left hand side expression in assignment: lhs: VariableLHS[~dev~4,] left hand side expression in assignment: lhs: VariableLHS[~context~1,] left hand side expression in assignment: lhs: VariableLHS[~stats~2,] left hand side expression in assignment: lhs: VariableLHS[~cf~3,] left hand side expression in assignment: lhs: VariableLHS[~size~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~8,] left hand side expression in assignment: lhs: VariableLHS[~urb~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~2,] left hand side expression in assignment: lhs: VariableLHS[~buf~1,] left hand side expression in assignment: lhs: VariableLHS[~msg~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~msg~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[15],StructAccessExpression[IdentifierExpression[~msg~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],StructAccessExpression[IdentifierExpression[~msg~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],StructAccessExpression[IdentifierExpression[~msg~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~msg~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],StructAccessExpression[IdentifierExpression[~msg~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],StructAccessExpression[IdentifierExpression[~msg~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~msg~1,],offset]],IdentifierExpression[~i~3,]]]] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~msg~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~msg~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~context~1,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~context~1,],base],StructAccessExpression[IdentifierExpression[~context~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~context~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~context~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~context~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~context~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[92],StructAccessExpression[IdentifierExpression[~urb~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~stats~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[908],StructAccessExpression[IdentifierExpression[~netdev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~stats~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~21,] left hand side expression in assignment: lhs: VariableLHS[~dev~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~9,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[252],StructAccessExpression[IdentifierExpression[~dev~5,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~22,] left hand side expression in assignment: lhs: VariableLHS[~dev~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~23,] left hand side expression in assignment: lhs: VariableLHS[~dev~7,] left hand side expression in assignment: lhs: VariableLHS[~bt~0,] left hand side expression in assignment: lhs: VariableLHS[~btr0~0,] left hand side expression in assignment: lhs: VariableLHS[~btr1~0,] left hand side expression in assignment: lhs: VariableLHS[~btr1~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[863],StructAccessExpression[IdentifierExpression[~dev~7,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[864],StructAccessExpression[IdentifierExpression[~dev~7,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~11,] left hand side expression in assignment: lhs: VariableLHS[~sja1000~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg,],base],StructAccessExpression[IdentifierExpression[~msg,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~msg,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~msg,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~msg,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[9],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~err~4,] left hand side expression in assignment: lhs: VariableLHS[~netdev~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~24,] 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],BinaryExpression[ARITHPLUS,IntegerLiteral[336],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[344],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] 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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[208],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[216],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[76],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[396],StructAccessExpression[IdentifierExpression[~netdev~4,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[420],StructAccessExpression[IdentifierExpression[~netdev~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[520],StructAccessExpression[IdentifierExpression[~dev~8,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[13],IdentifierExpression[~i~4,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[814],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~12,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[830],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[822],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1149],StructAccessExpression[IdentifierExpression[~netdev~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~4,] left hand side expression in assignment: lhs: VariableLHS[~err~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~25,] left hand side expression in assignment: lhs: VariableLHS[~dev~9,] left hand side expression in assignment: lhs: VariableLHS[~err~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~26,] left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~27,] left hand side expression in assignment: lhs: VariableLHS[~ldv_s_ems_usb_netdev_ops_net_device_ops~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_s_ems_usb_driver_usb_driver~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~13,] left hand side expression in assignment: lhs: VariableLHS[~res_ems_usb_open_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_s_ems_usb_netdev_ops_net_device_ops~0,] left hand side expression in assignment: lhs: VariableLHS[~res_ems_usb_close_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_s_ems_usb_netdev_ops_net_device_ops~0,] left hand side expression in assignment: lhs: VariableLHS[~res_ems_usb_probe_16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_s_ems_usb_driver_usb_driver~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_s_ems_usb_driver_usb_driver~0,] [2020-12-23 14:20:04,649 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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~28,] left hand side expression in assignment: lhs: VariableLHS[~arbitrary_memory~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_coherent_state~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_coherent_state~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~29,] left hand side expression in assignment: lhs: VariableLHS[~arbitrary_memory~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_urb_state~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_urb_state~0,GLOBAL] [2020-12-23 14:20:04,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 14:20:04,767 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~v,],base],StructAccessExpression[IdentifierExpression[~v,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] -----Light side constant value:false left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: lhs: VariableLHS[~__ret_warn_on~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~8,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~9,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[124],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[172],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[124],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[172],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[156],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[156],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[156],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[148],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~cf~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[244],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~dev~0,] left hand side expression in assignment: lhs: VariableLHS[~netdev~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~11,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[838],StructAccessExpression[IdentifierExpression[~dev~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~stats~0,] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem61,],base],StructAccessExpression[IdentifierExpression[#t~mem61,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~__min1~0,] left hand side expression in assignment: lhs: VariableLHS[~__min2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~12,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem64,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[#t~mem64,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem66,],base],StructAccessExpression[IdentifierExpression[#t~mem66,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem70,],base],StructAccessExpression[IdentifierExpression[#t~mem70,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem74,],base],StructAccessExpression[IdentifierExpression[#t~mem74,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem78,],base],StructAccessExpression[IdentifierExpression[#t~mem78,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem83,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[#t~mem83,],offset]],IdentifierExpression[~i~0,]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~0,],base],StructAccessExpression[IdentifierExpression[~stats~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~stats~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~stats~1,] left hand side expression in assignment: lhs: VariableLHS[~skb~1,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem95,],base],StructAccessExpression[IdentifierExpression[#t~mem95,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ecc~0,] left hand side expression in assignment: lhs: VariableLHS[~txerr~0,] left hand side expression in assignment: lhs: VariableLHS[~rxerr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],StructAccessExpression[IdentifierExpression[~dev,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~stats~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem107,],base],StructAccessExpression[IdentifierExpression[#t~mem107,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[#t~mem110,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[#t~mem113,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem116,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[#t~mem116,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem119,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[#t~mem119,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem122,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem122,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem123,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[#t~mem123,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem128,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[#t~mem128,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem129,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[#t~mem129,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem131,],base],StructAccessExpression[IdentifierExpression[#t~mem131,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem134,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[#t~mem134,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~stats~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~stats~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~1,],base],StructAccessExpression[IdentifierExpression[~stats~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~stats~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~dev~1,] left hand side expression in assignment: lhs: VariableLHS[~netdev~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~13,] left hand side expression in assignment: lhs: VariableLHS[~ibuf~0,] left hand side expression in assignment: lhs: VariableLHS[~msg_count~0,] left hand side expression in assignment: lhs: VariableLHS[~again~0,] left hand side expression in assignment: lhs: VariableLHS[~start~0,] left hand side expression in assignment: lhs: VariableLHS[~msg~0,] left hand side expression in assignment: lhs: VariableLHS[~start~0,] left hand side expression in assignment: lhs: VariableLHS[~msg_count~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~4,] left hand side expression in assignment: lhs: VariableLHS[~retval~0,] left hand side expression in assignment: lhs: VariableLHS[~context~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~14,] left hand side expression in assignment: lhs: VariableLHS[~dev~2,] left hand side expression in assignment: lhs: VariableLHS[~netdev~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[908],StructAccessExpression[IdentifierExpression[~netdev~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[196],StructAccessExpression[IdentifierExpression[~netdev~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[212],StructAccessExpression[IdentifierExpression[~netdev~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~context~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~context~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[854],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~16,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#cmd~0,],base],StructAccessExpression[IdentifierExpression[~#cmd~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#cmd~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~#cmd~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#cmd~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~#cmd~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#cmd~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~#cmd~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~17,] left hand side expression in assignment: lhs: VariableLHS[~netdev~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem210,],base],StructAccessExpression[IdentifierExpression[#t~mem210,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[838],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~urb~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~urb~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~18,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[92],StructAccessExpression[IdentifierExpression[~urb~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[520],StructAccessExpression[IdentifierExpression[~dev,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[13],IdentifierExpression[~i~2,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~19,] left hand side expression in assignment: lhs: VariableLHS[~dev~3,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[252],StructAccessExpression[IdentifierExpression[~dev~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~20,] left hand side expression in assignment: lhs: VariableLHS[~dev~4,] left hand side expression in assignment: lhs: VariableLHS[~context~1,] left hand side expression in assignment: lhs: VariableLHS[~stats~2,] left hand side expression in assignment: lhs: VariableLHS[~cf~3,] left hand side expression in assignment: lhs: VariableLHS[~size~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~8,] left hand side expression in assignment: lhs: VariableLHS[~urb~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~2,] left hand side expression in assignment: lhs: VariableLHS[~buf~1,] left hand side expression in assignment: lhs: VariableLHS[~msg~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~msg~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[15],StructAccessExpression[IdentifierExpression[~msg~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],StructAccessExpression[IdentifierExpression[~msg~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],StructAccessExpression[IdentifierExpression[~msg~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~msg~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],StructAccessExpression[IdentifierExpression[~msg~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],StructAccessExpression[IdentifierExpression[~msg~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~msg~1,],offset]],IdentifierExpression[~i~3,]]]] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~msg~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~msg~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~context~1,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~context~1,],base],StructAccessExpression[IdentifierExpression[~context~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~context~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~context~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~context~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~context~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[92],StructAccessExpression[IdentifierExpression[~urb~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~stats~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[908],StructAccessExpression[IdentifierExpression[~netdev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~stats~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~21,] left hand side expression in assignment: lhs: VariableLHS[~dev~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~9,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[252],StructAccessExpression[IdentifierExpression[~dev~5,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~22,] left hand side expression in assignment: lhs: VariableLHS[~dev~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~23,] left hand side expression in assignment: lhs: VariableLHS[~dev~7,] left hand side expression in assignment: lhs: VariableLHS[~bt~0,] left hand side expression in assignment: lhs: VariableLHS[~btr0~0,] left hand side expression in assignment: lhs: VariableLHS[~btr1~0,] left hand side expression in assignment: lhs: VariableLHS[~btr1~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[863],StructAccessExpression[IdentifierExpression[~dev~7,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[864],StructAccessExpression[IdentifierExpression[~dev~7,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~11,] left hand side expression in assignment: lhs: VariableLHS[~sja1000~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg,],base],StructAccessExpression[IdentifierExpression[~msg,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~msg,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~msg,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~msg,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~msg,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[9],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sja1000~0,],base],StructAccessExpression[IdentifierExpression[~sja1000~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~err~4,] left hand side expression in assignment: lhs: VariableLHS[~netdev~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~24,] 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],BinaryExpression[ARITHPLUS,IntegerLiteral[336],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[344],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] 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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[208],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[216],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[76],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[396],StructAccessExpression[IdentifierExpression[~netdev~4,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[420],StructAccessExpression[IdentifierExpression[~netdev~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[520],StructAccessExpression[IdentifierExpression[~dev~8,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[13],IdentifierExpression[~i~4,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[814],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~12,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[830],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~8,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[822],StructAccessExpression[IdentifierExpression[~dev~8,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~netdev~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1149],StructAccessExpression[IdentifierExpression[~netdev~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~4,] left hand side expression in assignment: lhs: VariableLHS[~err~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~25,] left hand side expression in assignment: lhs: VariableLHS[~dev~9,] left hand side expression in assignment: lhs: VariableLHS[~err~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~26,] left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~27,] left hand side expression in assignment: lhs: VariableLHS[~ldv_s_ems_usb_netdev_ops_net_device_ops~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_s_ems_usb_driver_usb_driver~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~13,] left hand side expression in assignment: lhs: VariableLHS[~res_ems_usb_open_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_s_ems_usb_netdev_ops_net_device_ops~0,] left hand side expression in assignment: lhs: VariableLHS[~res_ems_usb_close_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_s_ems_usb_netdev_ops_net_device_ops~0,] left hand side expression in assignment: lhs: VariableLHS[~res_ems_usb_probe_16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_s_ems_usb_driver_usb_driver~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_s_ems_usb_driver_usb_driver~0,] [2020-12-23 14:20:05,226 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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~28,] left hand side expression in assignment: lhs: VariableLHS[~arbitrary_memory~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_coherent_state~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_coherent_state~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~29,] left hand side expression in assignment: lhs: VariableLHS[~arbitrary_memory~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_urb_state~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_urb_state~0,GLOBAL] [2020-12-23 14:20:05,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 14:20:05,641 INFO L208 MainTranslator]: Completed translation [2020-12-23 14:20:05,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:20:05 WrapperNode [2020-12-23 14:20:05,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 14:20:05,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 14:20:05,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 14:20:05,644 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 14:20:05,655 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:20:05" (1/1) ... [2020-12-23 14:20:05,710 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:20:05" (1/1) ... [2020-12-23 14:20:05,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 14:20:05,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 14:20:05,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 14:20:05,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 14:20:05,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:20:05" (1/1) ... [2020-12-23 14:20:05,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:20:05" (1/1) ... [2020-12-23 14:20:05,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:20:05" (1/1) ... [2020-12-23 14:20:05,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:20:05" (1/1) ... [2020-12-23 14:20:06,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:20:05" (1/1) ... [2020-12-23 14:20:06,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:20:05" (1/1) ... [2020-12-23 14:20:06,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:20:05" (1/1) ... [2020-12-23 14:20:06,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 14:20:06,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 14:20:06,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 14:20:06,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 14:20:06,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:20:05" (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:20:06,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2020-12-23 14:20:06,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2020-12-23 14:20:06,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2020-12-23 14:20:06,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 14:20:06,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 14:20:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 14:20:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 14:20:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 14:20:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 14:20:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 14:20:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 14:20:06,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 14:20:06,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2020-12-23 14:20:06,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 14:20:06,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 14:20:07,087 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 14:20:12,968 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !false; [2020-12-23 14:20:12,969 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume false; [2020-12-23 14:20:12,984 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 14:20:12,985 INFO L299 CfgBuilder]: Removed 434 assume(true) statements. [2020-12-23 14:20:12,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:20:12 BoogieIcfgContainer [2020-12-23 14:20:12,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 14:20:12,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 14:20:12,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 14:20:12,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 14:20:12,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 02:20:02" (1/3) ... [2020-12-23 14:20:12,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ad816c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:20:12, skipping insertion in model container [2020-12-23 14:20:12,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:20:05" (2/3) ... [2020-12-23 14:20:12,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ad816c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:20:12, skipping insertion in model container [2020-12-23 14:20:12,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:20:12" (3/3) ... [2020-12-23 14:20:12,997 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2020-12-23 14:20:13,004 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 14:20:13,011 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2020-12-23 14:20:13,033 INFO L253 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2020-12-23 14:20:13,065 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 14:20:13,066 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 14:20:13,066 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 14:20:13,066 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 14:20:13,066 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 14:20:13,066 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 14:20:13,067 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 14:20:13,067 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 14:20:13,094 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2020-12-23 14:20:13,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-23 14:20:13,100 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:13,101 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:13,102 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:13,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:13,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1465825715, now seen corresponding path program 1 times [2020-12-23 14:20:13,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:13,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271738240] [2020-12-23 14:20:13,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:13,715 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:20:13,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271738240] [2020-12-23 14:20:13,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:13,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 14:20:13,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864898540] [2020-12-23 14:20:13,723 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:20:13,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:13,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:20:13,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:20:13,743 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 3 states. [2020-12-23 14:20:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:13,935 INFO L93 Difference]: Finished difference Result 1189 states and 1749 transitions. [2020-12-23 14:20:13,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:20:13,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-12-23 14:20:13,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:13,959 INFO L225 Difference]: With dead ends: 1189 [2020-12-23 14:20:13,960 INFO L226 Difference]: Without dead ends: 765 [2020-12-23 14:20:13,966 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:20:13,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2020-12-23 14:20:14,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 747. [2020-12-23 14:20:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2020-12-23 14:20:14,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 977 transitions. [2020-12-23 14:20:14,098 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 977 transitions. Word has length 10 [2020-12-23 14:20:14,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:14,098 INFO L481 AbstractCegarLoop]: Abstraction has 747 states and 977 transitions. [2020-12-23 14:20:14,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:20:14,099 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 977 transitions. [2020-12-23 14:20:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-23 14:20:14,099 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:14,099 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:14,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 14:20:14,100 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:14,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:14,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1804042980, now seen corresponding path program 1 times [2020-12-23 14:20:14,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:14,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516500986] [2020-12-23 14:20:14,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:14,312 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:20:14,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516500986] [2020-12-23 14:20:14,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:14,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 14:20:14,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294920864] [2020-12-23 14:20:14,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:20:14,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:14,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:20:14,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:20:14,318 INFO L87 Difference]: Start difference. First operand 747 states and 977 transitions. Second operand 3 states. [2020-12-23 14:20:14,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:14,427 INFO L93 Difference]: Finished difference Result 2217 states and 2904 transitions. [2020-12-23 14:20:14,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:20:14,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-23 14:20:14,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:14,437 INFO L225 Difference]: With dead ends: 2217 [2020-12-23 14:20:14,438 INFO L226 Difference]: Without dead ends: 1475 [2020-12-23 14:20:14,443 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:20:14,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2020-12-23 14:20:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1446. [2020-12-23 14:20:14,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1446 states. [2020-12-23 14:20:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1903 transitions. [2020-12-23 14:20:14,526 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1903 transitions. Word has length 11 [2020-12-23 14:20:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:14,527 INFO L481 AbstractCegarLoop]: Abstraction has 1446 states and 1903 transitions. [2020-12-23 14:20:14,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:20:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1903 transitions. [2020-12-23 14:20:14,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 14:20:14,533 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:14,533 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:14,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 14:20:14,534 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:14,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:14,536 INFO L82 PathProgramCache]: Analyzing trace with hash 739890622, now seen corresponding path program 1 times [2020-12-23 14:20:14,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:14,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595382104] [2020-12-23 14:20:14,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:14,752 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:20:14,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595382104] [2020-12-23 14:20:14,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:14,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:20:14,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160340418] [2020-12-23 14:20:14,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:20:14,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:14,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:20:14,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:20:14,756 INFO L87 Difference]: Start difference. First operand 1446 states and 1903 transitions. Second operand 3 states. [2020-12-23 14:20:14,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:14,888 INFO L93 Difference]: Finished difference Result 3924 states and 5208 transitions. [2020-12-23 14:20:14,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:20:14,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2020-12-23 14:20:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:14,902 INFO L225 Difference]: With dead ends: 3924 [2020-12-23 14:20:14,902 INFO L226 Difference]: Without dead ends: 2485 [2020-12-23 14:20:14,905 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:20:14,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2020-12-23 14:20:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2453. [2020-12-23 14:20:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2453 states. [2020-12-23 14:20:15,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3277 transitions. [2020-12-23 14:20:15,006 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3277 transitions. Word has length 38 [2020-12-23 14:20:15,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:15,007 INFO L481 AbstractCegarLoop]: Abstraction has 2453 states and 3277 transitions. [2020-12-23 14:20:15,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:20:15,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3277 transitions. [2020-12-23 14:20:15,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-23 14:20:15,014 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:15,015 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:15,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 14:20:15,016 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:15,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:15,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1309389857, now seen corresponding path program 1 times [2020-12-23 14:20:15,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:15,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783356236] [2020-12-23 14:20:15,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:20:15,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783356236] [2020-12-23 14:20:15,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:15,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:20:15,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645953127] [2020-12-23 14:20:15,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:20:15,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:15,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:20:15,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:20:15,237 INFO L87 Difference]: Start difference. First operand 2453 states and 3277 transitions. Second operand 4 states. [2020-12-23 14:20:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:15,486 INFO L93 Difference]: Finished difference Result 7327 states and 9781 transitions. [2020-12-23 14:20:15,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:20:15,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2020-12-23 14:20:15,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:15,519 INFO L225 Difference]: With dead ends: 7327 [2020-12-23 14:20:15,519 INFO L226 Difference]: Without dead ends: 4882 [2020-12-23 14:20:15,529 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:20:15,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states. [2020-12-23 14:20:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 2469. [2020-12-23 14:20:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2469 states. [2020-12-23 14:20:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3293 transitions. [2020-12-23 14:20:15,691 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3293 transitions. Word has length 41 [2020-12-23 14:20:15,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:15,692 INFO L481 AbstractCegarLoop]: Abstraction has 2469 states and 3293 transitions. [2020-12-23 14:20:15,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:20:15,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3293 transitions. [2020-12-23 14:20:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-23 14:20:15,696 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:15,696 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:15,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 14:20:15,697 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:15,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:15,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1996940455, now seen corresponding path program 1 times [2020-12-23 14:20:15,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:15,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800119436] [2020-12-23 14:20:15,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:15,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:20:15,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800119436] [2020-12-23 14:20:15,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:15,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 14:20:15,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770468493] [2020-12-23 14:20:15,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 14:20:15,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:15,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 14:20:15,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 14:20:15,957 INFO L87 Difference]: Start difference. First operand 2469 states and 3293 transitions. Second operand 6 states. [2020-12-23 14:20:16,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:16,596 INFO L93 Difference]: Finished difference Result 10245 states and 13645 transitions. [2020-12-23 14:20:16,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 14:20:16,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-12-23 14:20:16,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:16,640 INFO L225 Difference]: With dead ends: 10245 [2020-12-23 14:20:16,640 INFO L226 Difference]: Without dead ends: 7784 [2020-12-23 14:20:16,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-12-23 14:20:16,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7784 states. [2020-12-23 14:20:16,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7784 to 2485. [2020-12-23 14:20:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2485 states. [2020-12-23 14:20:16,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 3309 transitions. [2020-12-23 14:20:16,916 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 3309 transitions. Word has length 42 [2020-12-23 14:20:16,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:16,916 INFO L481 AbstractCegarLoop]: Abstraction has 2485 states and 3309 transitions. [2020-12-23 14:20:16,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 14:20:16,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 3309 transitions. [2020-12-23 14:20:16,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-23 14:20:16,918 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:16,919 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:16,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 14:20:16,919 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:16,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:16,920 INFO L82 PathProgramCache]: Analyzing trace with hash -942849768, now seen corresponding path program 1 times [2020-12-23 14:20:16,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:16,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430661076] [2020-12-23 14:20:16,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:20:17,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430661076] [2020-12-23 14:20:17,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:17,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:20:17,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072482278] [2020-12-23 14:20:17,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:20:17,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:17,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:20:17,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:20:17,109 INFO L87 Difference]: Start difference. First operand 2485 states and 3309 transitions. Second operand 5 states. [2020-12-23 14:20:18,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:18,214 INFO L93 Difference]: Finished difference Result 13586 states and 18045 transitions. [2020-12-23 14:20:18,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 14:20:18,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2020-12-23 14:20:18,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:18,339 INFO L225 Difference]: With dead ends: 13586 [2020-12-23 14:20:18,340 INFO L226 Difference]: Without dead ends: 12316 [2020-12-23 14:20:18,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 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 14:20:18,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12316 states. [2020-12-23 14:20:18,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12316 to 2545. [2020-12-23 14:20:18,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2545 states. [2020-12-23 14:20:18,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 3369 transitions. [2020-12-23 14:20:18,744 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 3369 transitions. Word has length 42 [2020-12-23 14:20:18,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:18,754 INFO L481 AbstractCegarLoop]: Abstraction has 2545 states and 3369 transitions. [2020-12-23 14:20:18,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:20:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 3369 transitions. [2020-12-23 14:20:18,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-23 14:20:18,759 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:18,759 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:18,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 14:20:18,760 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:18,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:18,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1763769626, now seen corresponding path program 1 times [2020-12-23 14:20:18,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:18,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402945419] [2020-12-23 14:20:18,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:18,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:20:18,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402945419] [2020-12-23 14:20:18,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:18,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 14:20:18,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151507098] [2020-12-23 14:20:18,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 14:20:18,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:18,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 14:20:18,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:20:18,982 INFO L87 Difference]: Start difference. First operand 2545 states and 3369 transitions. Second operand 7 states. [2020-12-23 14:20:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:20,747 INFO L93 Difference]: Finished difference Result 7308 states and 9691 transitions. [2020-12-23 14:20:20,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-23 14:20:20,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-12-23 14:20:20,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:20,775 INFO L225 Difference]: With dead ends: 7308 [2020-12-23 14:20:20,776 INFO L226 Difference]: Without dead ends: 6008 [2020-12-23 14:20:20,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2020-12-23 14:20:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2020-12-23 14:20:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 2553. [2020-12-23 14:20:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2020-12-23 14:20:21,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3377 transitions. [2020-12-23 14:20:21,107 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3377 transitions. Word has length 42 [2020-12-23 14:20:21,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:21,108 INFO L481 AbstractCegarLoop]: Abstraction has 2553 states and 3377 transitions. [2020-12-23 14:20:21,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 14:20:21,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3377 transitions. [2020-12-23 14:20:21,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 14:20:21,110 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:21,110 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:21,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 14:20:21,110 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:21,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:21,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1882537444, now seen corresponding path program 1 times [2020-12-23 14:20:21,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:21,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255399471] [2020-12-23 14:20:21,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:21,235 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:20:21,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255399471] [2020-12-23 14:20:21,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:21,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:20:21,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034582873] [2020-12-23 14:20:21,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:20:21,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:21,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:20:21,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:20:21,238 INFO L87 Difference]: Start difference. First operand 2553 states and 3377 transitions. Second operand 4 states. [2020-12-23 14:20:22,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:22,248 INFO L93 Difference]: Finished difference Result 8726 states and 11554 transitions. [2020-12-23 14:20:22,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:20:22,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-12-23 14:20:22,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:22,268 INFO L225 Difference]: With dead ends: 8726 [2020-12-23 14:20:22,268 INFO L226 Difference]: Without dead ends: 6181 [2020-12-23 14:20:22,275 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:20:22,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6181 states. [2020-12-23 14:20:22,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6181 to 2291. [2020-12-23 14:20:22,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 14:20:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3015 transitions. [2020-12-23 14:20:22,657 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3015 transitions. Word has length 44 [2020-12-23 14:20:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:22,660 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3015 transitions. [2020-12-23 14:20:22,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:20:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3015 transitions. [2020-12-23 14:20:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 14:20:22,661 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:22,662 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:22,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 14:20:22,662 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:22,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:22,663 INFO L82 PathProgramCache]: Analyzing trace with hash -297582244, now seen corresponding path program 1 times [2020-12-23 14:20:22,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:22,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127297761] [2020-12-23 14:20:22,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:22,841 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:20:22,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127297761] [2020-12-23 14:20:22,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:22,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:20:22,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105018418] [2020-12-23 14:20:22,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:20:22,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:22,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:20:22,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:20:22,849 INFO L87 Difference]: Start difference. First operand 2291 states and 3015 transitions. Second operand 4 states. [2020-12-23 14:20:23,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:23,828 INFO L93 Difference]: Finished difference Result 3590 states and 4725 transitions. [2020-12-23 14:20:23,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:20:23,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-12-23 14:20:23,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:23,840 INFO L225 Difference]: With dead ends: 3590 [2020-12-23 14:20:23,841 INFO L226 Difference]: Without dead ends: 3575 [2020-12-23 14:20:23,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:20:23,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3575 states. [2020-12-23 14:20:24,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3575 to 3547. [2020-12-23 14:20:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3547 states. [2020-12-23 14:20:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 4677 transitions. [2020-12-23 14:20:24,412 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 4677 transitions. Word has length 44 [2020-12-23 14:20:24,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:24,413 INFO L481 AbstractCegarLoop]: Abstraction has 3547 states and 4677 transitions. [2020-12-23 14:20:24,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:20:24,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 4677 transitions. [2020-12-23 14:20:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-23 14:20:24,415 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:24,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:24,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 14:20:24,415 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:24,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:24,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1289306960, now seen corresponding path program 1 times [2020-12-23 14:20:24,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:24,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435308040] [2020-12-23 14:20:24,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:24,550 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:20:24,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435308040] [2020-12-23 14:20:24,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:24,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:20:24,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94978675] [2020-12-23 14:20:24,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:20:24,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:24,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:20:24,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:20:24,553 INFO L87 Difference]: Start difference. First operand 3547 states and 4677 transitions. Second operand 3 states. [2020-12-23 14:20:25,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:25,041 INFO L93 Difference]: Finished difference Result 7164 states and 9501 transitions. [2020-12-23 14:20:25,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:20:25,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-12-23 14:20:25,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:25,052 INFO L225 Difference]: With dead ends: 7164 [2020-12-23 14:20:25,052 INFO L226 Difference]: Without dead ends: 3625 [2020-12-23 14:20:25,059 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:20:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3625 states. [2020-12-23 14:20:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3625 to 3625. [2020-12-23 14:20:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3625 states. [2020-12-23 14:20:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 4755 transitions. [2020-12-23 14:20:25,525 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 4755 transitions. Word has length 47 [2020-12-23 14:20:25,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:25,525 INFO L481 AbstractCegarLoop]: Abstraction has 3625 states and 4755 transitions. [2020-12-23 14:20:25,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:20:25,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 4755 transitions. [2020-12-23 14:20:25,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-23 14:20:25,528 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:25,528 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:25,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 14:20:25,529 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:25,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:25,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1848487698, now seen corresponding path program 1 times [2020-12-23 14:20:25,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:25,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62590345] [2020-12-23 14:20:25,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:25,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 14:20:25,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62590345] [2020-12-23 14:20:25,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:25,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 14:20:25,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758990991] [2020-12-23 14:20:25,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 14:20:25,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:25,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 14:20:25,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:20:25,764 INFO L87 Difference]: Start difference. First operand 3625 states and 4755 transitions. Second operand 7 states. [2020-12-23 14:20:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:27,357 INFO L93 Difference]: Finished difference Result 11844 states and 15579 transitions. [2020-12-23 14:20:27,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-23 14:20:27,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2020-12-23 14:20:27,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:27,386 INFO L225 Difference]: With dead ends: 11844 [2020-12-23 14:20:27,387 INFO L226 Difference]: Without dead ends: 9228 [2020-12-23 14:20:27,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2020-12-23 14:20:27,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9228 states. [2020-12-23 14:20:28,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9228 to 3641. [2020-12-23 14:20:28,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2020-12-23 14:20:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 4771 transitions. [2020-12-23 14:20:28,076 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 4771 transitions. Word has length 48 [2020-12-23 14:20:28,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:28,076 INFO L481 AbstractCegarLoop]: Abstraction has 3641 states and 4771 transitions. [2020-12-23 14:20:28,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 14:20:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 4771 transitions. [2020-12-23 14:20:28,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 14:20:28,079 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:28,079 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:28,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 14:20:28,080 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:28,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:28,080 INFO L82 PathProgramCache]: Analyzing trace with hash -6937233, now seen corresponding path program 1 times [2020-12-23 14:20:28,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:28,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314599667] [2020-12-23 14:20:28,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 14:20:28,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314599667] [2020-12-23 14:20:28,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:28,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:20:28,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426098277] [2020-12-23 14:20:28,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:20:28,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:28,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:20:28,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:20:28,238 INFO L87 Difference]: Start difference. First operand 3641 states and 4771 transitions. Second operand 4 states. [2020-12-23 14:20:29,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:29,304 INFO L93 Difference]: Finished difference Result 11655 states and 15280 transitions. [2020-12-23 14:20:29,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:20:29,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-12-23 14:20:29,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:29,326 INFO L225 Difference]: With dead ends: 11655 [2020-12-23 14:20:29,326 INFO L226 Difference]: Without dead ends: 8022 [2020-12-23 14:20:29,336 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:20:29,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8022 states. [2020-12-23 14:20:29,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8022 to 3079. [2020-12-23 14:20:29,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3079 states. [2020-12-23 14:20:29,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3079 states to 3079 states and 4025 transitions. [2020-12-23 14:20:29,726 INFO L78 Accepts]: Start accepts. Automaton has 3079 states and 4025 transitions. Word has length 52 [2020-12-23 14:20:29,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:29,727 INFO L481 AbstractCegarLoop]: Abstraction has 3079 states and 4025 transitions. [2020-12-23 14:20:29,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:20:29,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3079 states and 4025 transitions. [2020-12-23 14:20:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 14:20:29,729 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:29,729 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:29,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 14:20:29,730 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:29,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:29,730 INFO L82 PathProgramCache]: Analyzing trace with hash 291347065, now seen corresponding path program 1 times [2020-12-23 14:20:29,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:29,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090295356] [2020-12-23 14:20:29,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:29,886 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:20:29,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090295356] [2020-12-23 14:20:29,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:29,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:20:29,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541390334] [2020-12-23 14:20:29,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:20:29,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:29,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:20:29,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:20:29,895 INFO L87 Difference]: Start difference. First operand 3079 states and 4025 transitions. Second operand 4 states. [2020-12-23 14:20:30,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:30,980 INFO L93 Difference]: Finished difference Result 10255 states and 13390 transitions. [2020-12-23 14:20:30,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:20:30,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-12-23 14:20:30,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:31,001 INFO L225 Difference]: With dead ends: 10255 [2020-12-23 14:20:31,001 INFO L226 Difference]: Without dead ends: 7623 [2020-12-23 14:20:31,008 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:20:31,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7623 states. [2020-12-23 14:20:31,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7623 to 2871. [2020-12-23 14:20:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2871 states. [2020-12-23 14:20:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 3739 transitions. [2020-12-23 14:20:31,396 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 3739 transitions. Word has length 52 [2020-12-23 14:20:31,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:31,396 INFO L481 AbstractCegarLoop]: Abstraction has 2871 states and 3739 transitions. [2020-12-23 14:20:31,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:20:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 3739 transitions. [2020-12-23 14:20:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 14:20:31,399 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:31,399 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:31,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 14:20:31,399 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:31,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:31,400 INFO L82 PathProgramCache]: Analyzing trace with hash -729721289, now seen corresponding path program 1 times [2020-12-23 14:20:31,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:31,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978178673] [2020-12-23 14:20:31,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:31,544 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:20:31,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978178673] [2020-12-23 14:20:31,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:31,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:20:31,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034817630] [2020-12-23 14:20:31,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:20:31,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:31,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:20:31,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:20:31,546 INFO L87 Difference]: Start difference. First operand 2871 states and 3739 transitions. Second operand 5 states. [2020-12-23 14:20:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:34,001 INFO L93 Difference]: Finished difference Result 17188 states and 22486 transitions. [2020-12-23 14:20:34,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 14:20:34,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2020-12-23 14:20:34,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:34,030 INFO L225 Difference]: With dead ends: 17188 [2020-12-23 14:20:34,031 INFO L226 Difference]: Without dead ends: 15839 [2020-12-23 14:20:34,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 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 14:20:34,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15839 states. [2020-12-23 14:20:34,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15839 to 2919. [2020-12-23 14:20:34,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2919 states. [2020-12-23 14:20:34,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 3787 transitions. [2020-12-23 14:20:34,833 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 3787 transitions. Word has length 52 [2020-12-23 14:20:34,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:34,834 INFO L481 AbstractCegarLoop]: Abstraction has 2919 states and 3787 transitions. [2020-12-23 14:20:34,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:20:34,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 3787 transitions. [2020-12-23 14:20:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 14:20:34,836 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:34,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:34,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 14:20:34,837 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:34,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:34,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1876302265, now seen corresponding path program 1 times [2020-12-23 14:20:34,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:34,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156456584] [2020-12-23 14:20:34,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:34,958 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:20:34,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156456584] [2020-12-23 14:20:34,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:34,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:20:34,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797282269] [2020-12-23 14:20:34,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:20:34,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:34,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:20:34,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:20:34,964 INFO L87 Difference]: Start difference. First operand 2919 states and 3787 transitions. Second operand 3 states. [2020-12-23 14:20:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:35,697 INFO L93 Difference]: Finished difference Result 5465 states and 7096 transitions. [2020-12-23 14:20:35,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:20:35,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-12-23 14:20:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:35,702 INFO L225 Difference]: With dead ends: 5465 [2020-12-23 14:20:35,702 INFO L226 Difference]: Without dead ends: 4092 [2020-12-23 14:20:35,705 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:20:35,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4092 states. [2020-12-23 14:20:36,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4092 to 2927. [2020-12-23 14:20:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2927 states. [2020-12-23 14:20:36,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 3795 transitions. [2020-12-23 14:20:36,367 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 3795 transitions. Word has length 52 [2020-12-23 14:20:36,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:36,368 INFO L481 AbstractCegarLoop]: Abstraction has 2927 states and 3795 transitions. [2020-12-23 14:20:36,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:20:36,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 3795 transitions. [2020-12-23 14:20:36,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-23 14:20:36,370 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:36,371 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:36,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 14:20:36,371 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:36,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:36,372 INFO L82 PathProgramCache]: Analyzing trace with hash -873150611, now seen corresponding path program 1 times [2020-12-23 14:20:36,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:36,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700775729] [2020-12-23 14:20:36,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:36,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:20:36,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700775729] [2020-12-23 14:20:36,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:36,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 14:20:36,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391922738] [2020-12-23 14:20:36,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 14:20:36,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:36,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 14:20:36,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-23 14:20:36,657 INFO L87 Difference]: Start difference. First operand 2927 states and 3795 transitions. Second operand 9 states. [2020-12-23 14:20:41,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:41,129 INFO L93 Difference]: Finished difference Result 15400 states and 20063 transitions. [2020-12-23 14:20:41,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-12-23 14:20:41,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2020-12-23 14:20:41,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:41,150 INFO L225 Difference]: With dead ends: 15400 [2020-12-23 14:20:41,150 INFO L226 Difference]: Without dead ends: 12920 [2020-12-23 14:20:41,158 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=570, Invalid=2082, Unknown=0, NotChecked=0, Total=2652 [2020-12-23 14:20:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12920 states. [2020-12-23 14:20:42,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12920 to 2925. [2020-12-23 14:20:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2925 states. [2020-12-23 14:20:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 3781 transitions. [2020-12-23 14:20:42,098 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 3781 transitions. Word has length 53 [2020-12-23 14:20:42,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:42,098 INFO L481 AbstractCegarLoop]: Abstraction has 2925 states and 3781 transitions. [2020-12-23 14:20:42,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 14:20:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 3781 transitions. [2020-12-23 14:20:42,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-23 14:20:42,100 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:42,100 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 14:20:42,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 14:20:42,100 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:42,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:42,101 INFO L82 PathProgramCache]: Analyzing trace with hash 24644017, now seen corresponding path program 1 times [2020-12-23 14:20:42,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:42,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142941843] [2020-12-23 14:20:42,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:20:42,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142941843] [2020-12-23 14:20:42,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:42,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:20:42,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853565649] [2020-12-23 14:20:42,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:20:42,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:42,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:20:42,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:20:42,200 INFO L87 Difference]: Start difference. First operand 2925 states and 3781 transitions. Second operand 4 states. [2020-12-23 14:20:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:43,294 INFO L93 Difference]: Finished difference Result 5861 states and 7575 transitions. [2020-12-23 14:20:43,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:20:43,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-12-23 14:20:43,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:43,300 INFO L225 Difference]: With dead ends: 5861 [2020-12-23 14:20:43,300 INFO L226 Difference]: Without dead ends: 2942 [2020-12-23 14:20:43,308 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:20:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-12-23 14:20:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2929. [2020-12-23 14:20:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2929 states. [2020-12-23 14:20:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 3784 transitions. [2020-12-23 14:20:43,799 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 3784 transitions. Word has length 53 [2020-12-23 14:20:43,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:43,799 INFO L481 AbstractCegarLoop]: Abstraction has 2929 states and 3784 transitions. [2020-12-23 14:20:43,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:20:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 3784 transitions. [2020-12-23 14:20:43,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-23 14:20:43,801 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:43,801 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:43,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 14:20:43,802 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:43,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:43,802 INFO L82 PathProgramCache]: Analyzing trace with hash 446058872, now seen corresponding path program 1 times [2020-12-23 14:20:43,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:43,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809797153] [2020-12-23 14:20:43,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:43,952 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:20:43,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809797153] [2020-12-23 14:20:43,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:43,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:20:43,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554115999] [2020-12-23 14:20:43,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:20:43,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:43,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:20:43,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:20:43,958 INFO L87 Difference]: Start difference. First operand 2929 states and 3784 transitions. Second operand 4 states. [2020-12-23 14:20:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:45,230 INFO L93 Difference]: Finished difference Result 4319 states and 5567 transitions. [2020-12-23 14:20:45,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:20:45,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-12-23 14:20:45,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:45,236 INFO L225 Difference]: With dead ends: 4319 [2020-12-23 14:20:45,236 INFO L226 Difference]: Without dead ends: 4313 [2020-12-23 14:20:45,238 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:20:45,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2020-12-23 14:20:46,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4267. [2020-12-23 14:20:46,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4267 states. [2020-12-23 14:20:46,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 5520 transitions. [2020-12-23 14:20:46,104 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 5520 transitions. Word has length 54 [2020-12-23 14:20:46,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:46,104 INFO L481 AbstractCegarLoop]: Abstraction has 4267 states and 5520 transitions. [2020-12-23 14:20:46,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:20:46,104 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 5520 transitions. [2020-12-23 14:20:46,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-23 14:20:46,106 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:46,106 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:46,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 14:20:46,106 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:46,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:46,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1584391570, now seen corresponding path program 1 times [2020-12-23 14:20:46,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:46,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170546031] [2020-12-23 14:20:46,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 14:20:46,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170546031] [2020-12-23 14:20:46,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:46,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:20:46,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936689697] [2020-12-23 14:20:46,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:20:46,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:46,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:20:46,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:20:46,503 INFO L87 Difference]: Start difference. First operand 4267 states and 5520 transitions. Second operand 4 states. [2020-12-23 14:20:47,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:47,314 INFO L93 Difference]: Finished difference Result 8528 states and 11033 transitions. [2020-12-23 14:20:47,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:20:47,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2020-12-23 14:20:47,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:47,320 INFO L225 Difference]: With dead ends: 8528 [2020-12-23 14:20:47,320 INFO L226 Difference]: Without dead ends: 4267 [2020-12-23 14:20:47,326 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:20:47,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2020-12-23 14:20:48,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 4267. [2020-12-23 14:20:48,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4267 states. [2020-12-23 14:20:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 5519 transitions. [2020-12-23 14:20:48,102 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 5519 transitions. Word has length 55 [2020-12-23 14:20:48,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:48,102 INFO L481 AbstractCegarLoop]: Abstraction has 4267 states and 5519 transitions. [2020-12-23 14:20:48,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:20:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 5519 transitions. [2020-12-23 14:20:48,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-23 14:20:48,103 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:48,103 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:48,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 14:20:48,103 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:48,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:48,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1103311312, now seen corresponding path program 1 times [2020-12-23 14:20:48,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:48,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163482875] [2020-12-23 14:20:48,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 14:20:48,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163482875] [2020-12-23 14:20:48,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:48,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:20:48,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648659945] [2020-12-23 14:20:48,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:20:48,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:48,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:20:48,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:20:48,464 INFO L87 Difference]: Start difference. First operand 4267 states and 5519 transitions. Second operand 4 states. [2020-12-23 14:20:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:20:51,046 INFO L93 Difference]: Finished difference Result 11106 states and 14408 transitions. [2020-12-23 14:20:51,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:20:51,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2020-12-23 14:20:51,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:20:51,059 INFO L225 Difference]: With dead ends: 11106 [2020-12-23 14:20:51,060 INFO L226 Difference]: Without dead ends: 9158 [2020-12-23 14:20:51,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:20:51,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9158 states. [2020-12-23 14:20:52,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9158 to 9007. [2020-12-23 14:20:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9007 states. [2020-12-23 14:20:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9007 states to 9007 states and 11681 transitions. [2020-12-23 14:20:52,564 INFO L78 Accepts]: Start accepts. Automaton has 9007 states and 11681 transitions. Word has length 55 [2020-12-23 14:20:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:20:52,565 INFO L481 AbstractCegarLoop]: Abstraction has 9007 states and 11681 transitions. [2020-12-23 14:20:52,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:20:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 9007 states and 11681 transitions. [2020-12-23 14:20:52,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-23 14:20:52,566 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:20:52,566 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:20:52,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 14:20:52,566 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:20:52,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:20:52,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1514792705, now seen corresponding path program 1 times [2020-12-23 14:20:52,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:20:52,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532886157] [2020-12-23 14:20:52,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:20:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:20:52,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:20:52,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532886157] [2020-12-23 14:20:52,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:20:52,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 14:20:52,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227505147] [2020-12-23 14:20:52,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 14:20:52,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:20:52,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 14:20:52,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:20:52,704 INFO L87 Difference]: Start difference. First operand 9007 states and 11681 transitions. Second operand 7 states. [2020-12-23 14:21:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:21:07,402 INFO L93 Difference]: Finished difference Result 76339 states and 100137 transitions. [2020-12-23 14:21:07,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-23 14:21:07,403 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-12-23 14:21:07,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:21:07,504 INFO L225 Difference]: With dead ends: 76339 [2020-12-23 14:21:07,504 INFO L226 Difference]: Without dead ends: 68797 [2020-12-23 14:21:07,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2020-12-23 14:21:07,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68797 states. [2020-12-23 14:21:09,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68797 to 8971. [2020-12-23 14:21:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8971 states. [2020-12-23 14:21:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8971 states to 8971 states and 11591 transitions. [2020-12-23 14:21:09,999 INFO L78 Accepts]: Start accepts. Automaton has 8971 states and 11591 transitions. Word has length 56 [2020-12-23 14:21:09,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:21:09,999 INFO L481 AbstractCegarLoop]: Abstraction has 8971 states and 11591 transitions. [2020-12-23 14:21:09,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 14:21:09,999 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 11591 transitions. [2020-12-23 14:21:10,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-23 14:21:10,001 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:21:10,001 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:21:10,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 14:21:10,001 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:21:10,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:21:10,002 INFO L82 PathProgramCache]: Analyzing trace with hash 850396480, now seen corresponding path program 1 times [2020-12-23 14:21:10,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:21:10,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88528538] [2020-12-23 14:21:10,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:21:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:21:10,114 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:21:10,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88528538] [2020-12-23 14:21:10,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:21:10,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:21:10,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687894678] [2020-12-23 14:21:10,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:21:10,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:21:10,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:21:10,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:21:10,116 INFO L87 Difference]: Start difference. First operand 8971 states and 11591 transitions. Second operand 5 states. [2020-12-23 14:21:15,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:21:15,960 INFO L93 Difference]: Finished difference Result 24328 states and 31604 transitions. [2020-12-23 14:21:15,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 14:21:15,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2020-12-23 14:21:15,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:21:15,982 INFO L225 Difference]: With dead ends: 24328 [2020-12-23 14:21:15,982 INFO L226 Difference]: Without dead ends: 15359 [2020-12-23 14:21:15,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:21:16,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15359 states. [2020-12-23 14:21:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15359 to 8980. [2020-12-23 14:21:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8980 states. [2020-12-23 14:21:17,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8980 states to 8980 states and 11598 transitions. [2020-12-23 14:21:17,914 INFO L78 Accepts]: Start accepts. Automaton has 8980 states and 11598 transitions. Word has length 58 [2020-12-23 14:21:17,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:21:17,914 INFO L481 AbstractCegarLoop]: Abstraction has 8980 states and 11598 transitions. [2020-12-23 14:21:17,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:21:17,914 INFO L276 IsEmpty]: Start isEmpty. Operand 8980 states and 11598 transitions. [2020-12-23 14:21:17,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-23 14:21:17,916 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:21:17,916 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:21:17,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 14:21:17,916 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:21:17,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:21:17,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1274043202, now seen corresponding path program 1 times [2020-12-23 14:21:17,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:21:17,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821971727] [2020-12-23 14:21:17,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:21:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:21:18,013 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:21:18,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821971727] [2020-12-23 14:21:18,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:21:18,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:21:18,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562462961] [2020-12-23 14:21:18,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:21:18,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:21:18,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:21:18,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:21:18,016 INFO L87 Difference]: Start difference. First operand 8980 states and 11598 transitions. Second operand 3 states. [2020-12-23 14:21:20,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:21:20,357 INFO L93 Difference]: Finished difference Result 18000 states and 23252 transitions. [2020-12-23 14:21:20,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:21:20,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-12-23 14:21:20,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:21:20,368 INFO L225 Difference]: With dead ends: 18000 [2020-12-23 14:21:20,368 INFO L226 Difference]: Without dead ends: 9028 [2020-12-23 14:21:20,380 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:21:20,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9028 states. [2020-12-23 14:21:22,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9028 to 9012. [2020-12-23 14:21:22,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9012 states. [2020-12-23 14:21:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9012 states to 9012 states and 11630 transitions. [2020-12-23 14:21:22,130 INFO L78 Accepts]: Start accepts. Automaton has 9012 states and 11630 transitions. Word has length 58 [2020-12-23 14:21:22,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:21:22,130 INFO L481 AbstractCegarLoop]: Abstraction has 9012 states and 11630 transitions. [2020-12-23 14:21:22,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:21:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 9012 states and 11630 transitions. [2020-12-23 14:21:22,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-23 14:21:22,132 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:21:22,132 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:21:22,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 14:21:22,132 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:21:22,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:21:22,133 INFO L82 PathProgramCache]: Analyzing trace with hash -361538827, now seen corresponding path program 1 times [2020-12-23 14:21:22,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:21:22,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941781794] [2020-12-23 14:21:22,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:21:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:21:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 14:21:22,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941781794] [2020-12-23 14:21:22,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:21:22,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:21:22,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273486571] [2020-12-23 14:21:22,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:21:22,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:21:22,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:21:22,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:21:22,229 INFO L87 Difference]: Start difference. First operand 9012 states and 11630 transitions. Second operand 4 states. [2020-12-23 14:21:27,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:21:27,070 INFO L93 Difference]: Finished difference Result 34083 states and 43728 transitions. [2020-12-23 14:21:27,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:21:27,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-12-23 14:21:27,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:21:27,105 INFO L225 Difference]: With dead ends: 34083 [2020-12-23 14:21:27,105 INFO L226 Difference]: Without dead ends: 25079 [2020-12-23 14:21:27,116 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:21:27,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25079 states. [2020-12-23 14:21:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25079 to 9076. [2020-12-23 14:21:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9076 states. [2020-12-23 14:21:29,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9076 states to 9076 states and 11694 transitions. [2020-12-23 14:21:29,232 INFO L78 Accepts]: Start accepts. Automaton has 9076 states and 11694 transitions. Word has length 60 [2020-12-23 14:21:29,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:21:29,232 INFO L481 AbstractCegarLoop]: Abstraction has 9076 states and 11694 transitions. [2020-12-23 14:21:29,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:21:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 9076 states and 11694 transitions. [2020-12-23 14:21:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-23 14:21:29,234 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:21:29,234 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:21:29,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 14:21:29,234 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:21:29,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:21:29,235 INFO L82 PathProgramCache]: Analyzing trace with hash 772416922, now seen corresponding path program 1 times [2020-12-23 14:21:29,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:21:29,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261848821] [2020-12-23 14:21:29,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:21:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:21:29,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 14:21:29,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261848821] [2020-12-23 14:21:29,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:21:29,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:21:29,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923840250] [2020-12-23 14:21:29,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:21:29,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:21:29,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:21:29,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:21:29,371 INFO L87 Difference]: Start difference. First operand 9076 states and 11694 transitions. Second operand 4 states. [2020-12-23 14:21:35,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:21:35,048 INFO L93 Difference]: Finished difference Result 31979 states and 41228 transitions. [2020-12-23 14:21:35,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:21:35,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-12-23 14:21:35,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:21:35,081 INFO L225 Difference]: With dead ends: 31979 [2020-12-23 14:21:35,081 INFO L226 Difference]: Without dead ends: 24398 [2020-12-23 14:21:35,091 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:21:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24398 states. [2020-12-23 14:21:37,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24398 to 8951. [2020-12-23 14:21:37,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8951 states. [2020-12-23 14:21:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8951 states to 8951 states and 11527 transitions. [2020-12-23 14:21:37,041 INFO L78 Accepts]: Start accepts. Automaton has 8951 states and 11527 transitions. Word has length 60 [2020-12-23 14:21:37,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:21:37,042 INFO L481 AbstractCegarLoop]: Abstraction has 8951 states and 11527 transitions. [2020-12-23 14:21:37,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:21:37,042 INFO L276 IsEmpty]: Start isEmpty. Operand 8951 states and 11527 transitions. [2020-12-23 14:21:37,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 14:21:37,043 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:21:37,044 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:21:37,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 14:21:37,044 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:21:37,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:21:37,044 INFO L82 PathProgramCache]: Analyzing trace with hash 2037876465, now seen corresponding path program 1 times [2020-12-23 14:21:37,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:21:37,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202490544] [2020-12-23 14:21:37,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:21:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:21:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:21:37,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202490544] [2020-12-23 14:21:37,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781647278] [2020-12-23 14:21:37,150 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:21:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:21:37,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 14:21:37,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:21:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:21:38,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 14:21:38,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-12-23 14:21:38,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711751574] [2020-12-23 14:21:38,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 14:21:38,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:21:38,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 14:21:38,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-23 14:21:38,021 INFO L87 Difference]: Start difference. First operand 8951 states and 11527 transitions. Second operand 6 states. [2020-12-23 14:21:40,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:21:40,941 INFO L93 Difference]: Finished difference Result 18102 states and 23462 transitions. [2020-12-23 14:21:40,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:21:40,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2020-12-23 14:21:40,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:21:40,972 INFO L225 Difference]: With dead ends: 18102 [2020-12-23 14:21:40,973 INFO L226 Difference]: Without dead ends: 9159 [2020-12-23 14:21:40,983 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-23 14:21:40,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9159 states. [2020-12-23 14:21:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9159 to 9159. [2020-12-23 14:21:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9159 states. [2020-12-23 14:21:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9159 states to 9159 states and 11735 transitions. [2020-12-23 14:21:43,138 INFO L78 Accepts]: Start accepts. Automaton has 9159 states and 11735 transitions. Word has length 61 [2020-12-23 14:21:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:21:43,138 INFO L481 AbstractCegarLoop]: Abstraction has 9159 states and 11735 transitions. [2020-12-23 14:21:43,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 14:21:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 9159 states and 11735 transitions. [2020-12-23 14:21:43,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 14:21:43,140 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:21:43,140 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] [2020-12-23 14:21:43,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-12-23 14:21:43,355 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:21:43,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:21:43,356 INFO L82 PathProgramCache]: Analyzing trace with hash 306863343, now seen corresponding path program 1 times [2020-12-23 14:21:43,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:21:43,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095156675] [2020-12-23 14:21:43,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:21:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:21:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:21:43,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095156675] [2020-12-23 14:21:43,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065902381] [2020-12-23 14:21:43,486 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 14:21:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:21:44,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 14:21:44,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:21:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:21:44,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 14:21:44,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-12-23 14:21:44,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346826480] [2020-12-23 14:21:44,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:21:44,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:21:44,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:21:44,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:21:44,157 INFO L87 Difference]: Start difference. First operand 9159 states and 11735 transitions. Second operand 5 states. [2020-12-23 14:21:46,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:21:46,343 INFO L93 Difference]: Finished difference Result 18374 states and 23542 transitions. [2020-12-23 14:21:46,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:21:46,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-12-23 14:21:46,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:21:46,358 INFO L225 Difference]: With dead ends: 18374 [2020-12-23 14:21:46,359 INFO L226 Difference]: Without dead ends: 9223 [2020-12-23 14:21:46,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:21:46,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2020-12-23 14:21:48,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 9207. [2020-12-23 14:21:48,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9207 states. [2020-12-23 14:21:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9207 states to 9207 states and 11783 transitions. [2020-12-23 14:21:48,518 INFO L78 Accepts]: Start accepts. Automaton has 9207 states and 11783 transitions. Word has length 61 [2020-12-23 14:21:48,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:21:48,518 INFO L481 AbstractCegarLoop]: Abstraction has 9207 states and 11783 transitions. [2020-12-23 14:21:48,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:21:48,518 INFO L276 IsEmpty]: Start isEmpty. Operand 9207 states and 11783 transitions. [2020-12-23 14:21:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 14:21:48,520 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:21:48,520 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] [2020-12-23 14:21:48,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-12-23 14:21:48,734 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:21:48,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:21:48,735 INFO L82 PathProgramCache]: Analyzing trace with hash -113453997, now seen corresponding path program 2 times [2020-12-23 14:21:48,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:21:48,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417853968] [2020-12-23 14:21:48,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:21:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:21:48,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:21:48,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417853968] [2020-12-23 14:21:48,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487384937] [2020-12-23 14:21:48,880 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 14:21:49,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 14:21:49,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 14:21:49,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 14:21:49,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:21:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 14:21:49,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 14:21:49,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2020-12-23 14:21:49,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983931544] [2020-12-23 14:21:49,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 14:21:49,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:21:49,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 14:21:49,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-12-23 14:21:49,708 INFO L87 Difference]: Start difference. First operand 9207 states and 11783 transitions. Second operand 8 states. [2020-12-23 14:22:11,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:22:11,328 INFO L93 Difference]: Finished difference Result 83091 states and 108221 transitions. [2020-12-23 14:22:11,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-12-23 14:22:11,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2020-12-23 14:22:11,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:22:11,460 INFO L225 Difference]: With dead ends: 83091 [2020-12-23 14:22:11,461 INFO L226 Difference]: Without dead ends: 73892 [2020-12-23 14:22:11,492 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=346, Invalid=1376, Unknown=0, NotChecked=0, Total=1722 [2020-12-23 14:22:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73892 states. [2020-12-23 14:22:14,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73892 to 9063. [2020-12-23 14:22:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9063 states. [2020-12-23 14:22:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 11523 transitions. [2020-12-23 14:22:14,734 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 11523 transitions. Word has length 62 [2020-12-23 14:22:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:22:14,734 INFO L481 AbstractCegarLoop]: Abstraction has 9063 states and 11523 transitions. [2020-12-23 14:22:14,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 14:22:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 11523 transitions. [2020-12-23 14:22:14,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 14:22:14,779 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:22:14,779 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:22:14,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-12-23 14:22:14,980 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:22:14,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:22:14,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1699998706, now seen corresponding path program 1 times [2020-12-23 14:22:14,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:22:14,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971868483] [2020-12-23 14:22:14,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:22:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:22:15,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:22:15,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971868483] [2020-12-23 14:22:15,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:22:15,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 14:22:15,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50226805] [2020-12-23 14:22:15,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 14:22:15,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:22:15,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 14:22:15,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-23 14:22:15,184 INFO L87 Difference]: Start difference. First operand 9063 states and 11523 transitions. Second operand 9 states. [2020-12-23 14:22:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:22:26,210 INFO L93 Difference]: Finished difference Result 33696 states and 42880 transitions. [2020-12-23 14:22:26,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2020-12-23 14:22:26,210 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2020-12-23 14:22:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:22:26,245 INFO L225 Difference]: With dead ends: 33696 [2020-12-23 14:22:26,246 INFO L226 Difference]: Without dead ends: 28121 [2020-12-23 14:22:26,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=570, Invalid=2082, Unknown=0, NotChecked=0, Total=2652 [2020-12-23 14:22:26,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28121 states. [2020-12-23 14:22:28,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28121 to 9037. [2020-12-23 14:22:28,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9037 states. [2020-12-23 14:22:28,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9037 states to 9037 states and 11465 transitions. [2020-12-23 14:22:28,902 INFO L78 Accepts]: Start accepts. Automaton has 9037 states and 11465 transitions. Word has length 62 [2020-12-23 14:22:28,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:22:28,902 INFO L481 AbstractCegarLoop]: Abstraction has 9037 states and 11465 transitions. [2020-12-23 14:22:28,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 14:22:28,902 INFO L276 IsEmpty]: Start isEmpty. Operand 9037 states and 11465 transitions. [2020-12-23 14:22:28,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-23 14:22:28,904 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:22:28,904 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:22:28,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 14:22:28,904 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:22:28,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:22:28,905 INFO L82 PathProgramCache]: Analyzing trace with hash -86443031, now seen corresponding path program 1 times [2020-12-23 14:22:28,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:22:28,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961727949] [2020-12-23 14:22:28,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:22:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 14:22:29,302 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 14:22:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 14:22:29,733 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 14:22:29,907 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 14:22:29,908 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 14:22:29,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 14:22:30,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 02:22:30 BoogieIcfgContainer [2020-12-23 14:22:30,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 14:22:30,244 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 14:22:30,244 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 14:22:30,244 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 14:22:30,244 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:20:12" (3/4) ... [2020-12-23 14:22:30,249 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-23 14:22:30,249 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 14:22:30,251 INFO L168 Benchmark]: Toolchain (without parser) took 147597.13 ms. Allocated memory was 158.3 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 126.1 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 715.2 MB. Max. memory is 8.0 GB. [2020-12-23 14:22:30,251 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 158.3 MB. Free memory is still 130.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 14:22:30,252 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2983.73 ms. Allocated memory was 158.3 MB in the beginning and 209.7 MB in the end (delta: 51.4 MB). Free memory was 125.9 MB in the beginning and 159.5 MB in the end (delta: -33.6 MB). Peak memory consumption was 106.5 MB. Max. memory is 8.0 GB. [2020-12-23 14:22:30,252 INFO L168 Benchmark]: Boogie Procedure Inliner took 237.87 ms. Allocated memory is still 209.7 MB. Free memory was 159.5 MB in the beginning and 143.8 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2020-12-23 14:22:30,253 INFO L168 Benchmark]: Boogie Preprocessor took 256.48 ms. Allocated memory is still 209.7 MB. Free memory was 143.8 MB in the beginning and 129.5 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-12-23 14:22:30,253 INFO L168 Benchmark]: RCFGBuilder took 6847.60 ms. Allocated memory was 209.7 MB in the beginning and 288.4 MB in the end (delta: 78.6 MB). Free memory was 129.5 MB in the beginning and 168.0 MB in the end (delta: -38.5 MB). Peak memory consumption was 97.4 MB. Max. memory is 8.0 GB. [2020-12-23 14:22:30,253 INFO L168 Benchmark]: TraceAbstraction took 137253.79 ms. Allocated memory was 288.4 MB in the beginning and 3.4 GB in the end (delta: 3.1 GB). Free memory was 167.4 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 625.7 MB. Max. memory is 8.0 GB. [2020-12-23 14:22:30,254 INFO L168 Benchmark]: Witness Printer took 5.25 ms. Allocated memory is still 3.4 GB. Free memory is still 2.6 GB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 14:22:30,256 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 158.3 MB. Free memory is still 130.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 2983.73 ms. Allocated memory was 158.3 MB in the beginning and 209.7 MB in the end (delta: 51.4 MB). Free memory was 125.9 MB in the beginning and 159.5 MB in the end (delta: -33.6 MB). Peak memory consumption was 106.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 237.87 ms. Allocated memory is still 209.7 MB. Free memory was 159.5 MB in the beginning and 143.8 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 256.48 ms. Allocated memory is still 209.7 MB. Free memory was 143.8 MB in the beginning and 129.5 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * RCFGBuilder took 6847.60 ms. Allocated memory was 209.7 MB in the beginning and 288.4 MB in the end (delta: 78.6 MB). Free memory was 129.5 MB in the beginning and 168.0 MB in the end (delta: -38.5 MB). Peak memory consumption was 97.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 137253.79 ms. Allocated memory was 288.4 MB in the beginning and 3.4 GB in the end (delta: 3.1 GB). Free memory was 167.4 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 625.7 MB. Max. memory is 8.0 GB. * Witness Printer took 5.25 ms. Allocated memory is still 3.4 GB. Free memory is still 2.6 GB. There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 5143, overapproximation of bitwiseAnd at line 6104. Possible FailurePath: [L5149] static struct lock_class_key __key___7 ; [L5150] static struct lock_class_key __key___8 ; [L5290-L5303] static char const __mod_author31[46] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'S', (char const )'e', (char const )'b', (char const )'a', (char const )'s', (char const )'t', (char const )'i', (char const )'a', (char const )'n', (char const )' ', (char const )'H', (char const )'a', (char const )'a', (char const )'s', (char const )' ', (char const )'<', (char const )'h', (char const )'a', (char const )'a', (char const )'s', (char const )'@', (char const )'e', (char const )'m', (char const )'s', (char const )'-', (char const )'w', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )'.', (char const )'c', (char const )'o', (char const )'m', (char const )'>', (char const )'\000'}; [L5304-L5323] static char const __mod_description32[70] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'N', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )' ', (char const )'f', (char const )'o', (char const )'r', (char const )' ', (char const )'E', (char const )'M', (char const )'S', (char const )' ', (char const )'D', (char const )'r', (char const )'.', (char const )' ', (char const )'T', (char const )'h', (char const )'o', (char const )'m', (char const )'a', (char const )'s', (char const )' ', (char const )'W', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )' ', (char const )'C', (char const )'A', (char const )'N', (char const )'/', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'i', (char const )'n', (char const )'t', (char const )'e', (char const )'r', (char const )'f', (char const )'a', (char const )'c', (char const )'e', (char const )'s', (char const )'\000'}; [L5324-L5329] static char const __mod_license33[15] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )' ', (char const )'v', (char const )'2', (char const )'\000'}; [L5330-L5332] static struct usb_device_id ems_usb_table[1] = { {(__u16 )3, (__u16 )4822, (__u16 )1092, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6247-L6287] static struct net_device_ops const ems_usb_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & ems_usb_open, & ems_usb_close, & ems_usb_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , void *addr ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, (int (*)(struct net_device *dev , int new_mtu ))0, (int (*)(struct net_device *dev , struct neigh_parms * ))0, (void (*)(struct net_device *dev ))0, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6288-L6292] static struct can_bittiming_const ems_usb_bittiming_const = {{(char )'e', (char )'m', (char )'s', (char )'_', (char )'u', (char )'s', (char )'b', (char )'\000', (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0}, (__u32 )1, (__u32 )16, (__u32 )1, (__u32 )8, (__u32 )4, (__u32 )1, (__u32 )64, (__u32 )1}; [L6543-L6561] static struct usb_driver ems_usb_driver = {"ems_usb", & ems_usb_probe, & ems_usb_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(ems_usb_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6614] int LDV_IN_INTERRUPT ; [L6615] static int res_ems_usb_open_10 ; [L6616] static int res_ems_usb_close_12 ; [L6617] static int res_ems_usb_probe_16 ; [L6767] int ldv_urb_state = 0; [L6768] int ldv_coherent_state = 0; VAL [__key___7={123:0}, __key___8={91:0}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6619] struct net_device *var_group1 ; [L6620] struct sk_buff *var_group2 ; [L6621] struct usb_interface *var_group3 ; [L6622] struct usb_device_id const *var_ems_usb_probe_16_p1 ; [L6623] int tmp___7 ; [L6624] int ldv_s_ems_usb_netdev_ops_net_device_ops ; [L6625] int ldv_s_ems_usb_driver_usb_driver ; [L6626] int tmp___8 ; [L6627] int tmp___9 ; [L6630] LDV_IN_INTERRUPT = 1 VAL [__key___7={123:0}, __key___8={91:0}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6565] int err ; [L5140] int tmp___7 ; [L5143] CALL, EXPR usb_register_driver(driver, & __this_module, "ems_usb") [L7025] return __VERIFIER_nondet_int(); [L5143] tmp___7 = usb_register_driver(driver, & __this_module, "ems_usb") [L5145] return (tmp___7); VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6569] err = usb_register(& ems_usb_driver) [L6571] COND FALSE !(\read(err)) [L6578] return (0); VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6632] tmp___7 = ems_usb_init() [L6634] COND FALSE !(\read(tmp___7)) [L6638] ldv_s_ems_usb_netdev_ops_net_device_ops = 0 [L6639] ldv_s_ems_usb_driver_usb_driver = 0 VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6641] COND TRUE 1 VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6644] tmp___9 = __VERIFIER_nondet_int() [L6646] COND TRUE \read(tmp___9) VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6655] tmp___8 = __VERIFIER_nondet_int() [L6657] COND FALSE !(tmp___8 == 0) VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6660] COND FALSE !(tmp___8 == 1) VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6663] COND TRUE tmp___8 == 2 VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6048] struct ems_usb *dev ; [L6049] void *tmp___7 ; [L6050] struct ems_tx_urb_context *context ; [L6051] struct net_device_stats *stats ; [L6052] struct can_frame *cf ; [L6053] struct ems_cpc_msg *msg ; [L6054] struct urb *urb ; [L6055] u8 *buf ; [L6056] int i ; [L6057] int err ; [L6058] size_t size ; [L6059] int tmp___8 ; [L6060] void *tmp___9 ; [L6061] unsigned int tmp___10 ; [L6062] int tmp___11 ; [L6063] long tmp___12 ; [L4976] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6066] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6067] dev = (struct ems_usb *)tmp___7 [L6068] context = (struct ems_tx_urb_context *)((void *)0) [L6069] stats = & netdev->stats [L6070] EXPR skb->data [L6070] cf = (struct can_frame *)skb->data [L6071] size = 15UL + sizeof(struct cpc_can_msg ) [L5252] struct can_frame const *cf ; [L5253] int tmp___7 ; [L5254] long tmp___8 ; [L5256] EXPR skb->data [L5256] cf = (struct can_frame const *)((struct can_frame *)skb->data) [L5257] EXPR skb->len VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5257] COND FALSE !((unsigned long )skb->len != sizeof(*cf)) [L5260] EXPR cf->can_dlc VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5260] COND FALSE !((int const )cf->can_dlc > 8) [L5263] tmp___7 = 0 VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5266] tmp___8 = __builtin_expect((long )tmp___7, 0L) VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5268] COND FALSE !(\read(tmp___8)) [L5276] return (0); VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6072] tmp___8 = can_dropped_invalid_skb(netdev, skb) [L6074] COND FALSE !(\read(tmp___8)) [L6830] void *arbitrary_memory ; [L6831] void *tmp___7 ; VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6834] COND TRUE 1 VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6911] COND FALSE !(__VERIFIER_nondet_bool()) [L6912] return malloc(size); VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6982] return ldv_malloc(0UL); [L6837] tmp___7 = ldv_undefined_pointer() [L6838] arbitrary_memory = tmp___7 VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6840] COND FALSE !(! arbitrary_memory) [L6844] ldv_urb_state = ldv_urb_state + 1 [L6845] return ((struct urb *)arbitrary_memory); VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6079] urb = usb_alloc_urb(0, 32U) [L6081] COND FALSE !(! urb) [L6089] EXPR dev->udev [L6773] void *arbitrary_memory ; [L6774] void *tmp___7 ; VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6777] COND TRUE 1 VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6911] COND FALSE !(__VERIFIER_nondet_bool()) [L6912] return malloc(size); VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6982] return ldv_malloc(0UL); [L6780] tmp___7 = ldv_undefined_pointer() [L6781] arbitrary_memory = tmp___7 VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6783] COND FALSE !(! arbitrary_memory) [L6787] ldv_coherent_state = ldv_coherent_state + 1 [L6788] return (arbitrary_memory); VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6089] tmp___9 = usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) [L6090] buf = (u8 *)tmp___9 VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6092] COND FALSE !(! buf) [L6100] msg = (struct ems_cpc_msg *)(buf + 4) [L6101] EXPR cf->can_id [L6101] msg->msg.can_msg.id = cf->can_id & 536870911U [L6102] EXPR cf->can_dlc [L6102] msg->msg.can_msg.length = cf->can_dlc [L6103] EXPR cf->can_id VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6103] COND TRUE cf->can_id & 1073741824U [L6104] EXPR cf->can_id VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6104] COND TRUE cf->can_id & 2147483648U [L6105] msg->type = (u8 )16 VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6109] msg->length = (u8 )5 VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6132] EXPR msg->msg.can_msg.id [L6132] msg->msg.can_msg.id = msg->msg.can_msg.id [L6133] i = 0 VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6135] COND TRUE 1 VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6137] COND TRUE i < 10 VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6141] EXPR dev->tx_contexts[i].echo_index VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6141] COND TRUE dev->tx_contexts[i].echo_index == 10U [L6142] context = & dev->tx_contexts[i] VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6151] COND TRUE ! context [L6154] dev->udev [L6154] urb->transfer_dma [L6802] COND TRUE 1 VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6804] COND FALSE !(! ((unsigned long )addr != (unsigned long )((void *)0))) VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6810] COND TRUE \read(*addr) VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6811] COND TRUE ldv_coherent_state >= 1 VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6817] ldv_coherent_state = ldv_coherent_state - 1 VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6155] netdev->dev.parent [L6157] return ((netdev_tx_t )16); VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6641] COND TRUE 1 VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6644] tmp___9 = __VERIFIER_nondet_int() [L6646] COND FALSE !(\read(tmp___9)) VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6648] COND FALSE !(! (ldv_s_ems_usb_netdev_ops_net_device_ops == 0)) VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6650] COND FALSE !(! (ldv_s_ems_usb_driver_usb_driver == 0)) VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6889] COND FALSE !(ldv_urb_state == 0) VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6754] reach_error() VAL [__key___7={123:0}, __key___8={91:0}, __this_module={18446744073709551627:18446744073709551616}, ems_usb_bittiming_const={130:0}, ems_usb_driver={126:0}, ems_usb_netdev_ops={127:0}, ems_usb_table={73:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 410 locations, 11 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 136.8s, OverallIterations: 30, TraceHistogramMax: 2, AutomataDifference: 96.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 28036 SDtfs, 43558 SDslu, 67154 SDs, 0 SdLazy, 2803 SolverSat, 317 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 588 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2486 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9207occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 30.7s AutomataMinimizationTime, 29 MinimizatonAttempts, 246107 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1673 NumberOfCodeBlocks, 1671 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1577 ConstructedInterpolants, 0 QuantifiedInterpolants, 124922 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3492 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 32 InterpolantComputations, 27 PerfectInterpolantSequences, 42/51 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...