/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-178dd20 [2021-01-07 00:15:37,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 00:15:37,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 00:15:37,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 00:15:37,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 00:15:37,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 00:15:37,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 00:15:37,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 00:15:37,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 00:15:37,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 00:15:37,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 00:15:37,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 00:15:37,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 00:15:37,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 00:15:37,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 00:15:37,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 00:15:37,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 00:15:37,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 00:15:37,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 00:15:37,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 00:15:37,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 00:15:37,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 00:15:37,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 00:15:37,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 00:15:37,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 00:15:37,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 00:15:37,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 00:15:37,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 00:15:37,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 00:15:37,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 00:15:37,790 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 00:15:37,791 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 00:15:37,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 00:15:37,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 00:15:37,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 00:15:37,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 00:15:37,796 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 00:15:37,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 00:15:37,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 00:15:37,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 00:15:37,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 00:15:37,810 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-07 00:15:37,855 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 00:15:37,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 00:15:37,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 00:15:37,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 00:15:37,860 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 00:15:37,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 00:15:37,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 00:15:37,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 00:15:37,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 00:15:37,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 00:15:37,863 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 00:15:37,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 00:15:37,863 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 00:15:37,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 00:15:37,864 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 00:15:37,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 00:15:37,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 00:15:37,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 00:15:37,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 00:15:37,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 00:15:37,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 00:15:37,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 00:15:37,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 00:15:37,866 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 00:15:37,866 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 00:15:37,866 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-07 00:15:38,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 00:15:38,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 00:15:38,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 00:15:38,371 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 00:15:38,374 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 00:15:38,375 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 [2021-01-07 00:15:38,468 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5e409e3bf/233fc420c9084d7f89cb70de320cb4a4/FLAG94072129b [2021-01-07 00:15:39,602 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 00:15:39,603 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 [2021-01-07 00:15:39,654 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5e409e3bf/233fc420c9084d7f89cb70de320cb4a4/FLAG94072129b [2021-01-07 00:15:39,679 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5e409e3bf/233fc420c9084d7f89cb70de320cb4a4 [2021-01-07 00:15:39,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 00:15:39,685 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 00:15:39,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 00:15:39,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 00:15:39,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 00:15:39,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 12:15:39" (1/1) ... [2021-01-07 00:15:39,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1df7fbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:15:39, skipping insertion in model container [2021-01-07 00:15:39,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 12:15:39" (1/1) ... [2021-01-07 00:15:39,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 00:15:39,841 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,] 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,] [2021-01-07 00:15:41,520 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] [2021-01-07 00:15:41,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:15:41,649 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,] 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,] [2021-01-07 00:15:41,974 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] [2021-01-07 00:15:41,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:15:42,285 INFO L208 MainTranslator]: Completed translation [2021-01-07 00:15:42,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:15:42 WrapperNode [2021-01-07 00:15:42,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 00:15:42,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 00:15:42,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 00:15:42,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 00:15:42,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:15:42" (1/1) ... [2021-01-07 00:15:42,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:15:42" (1/1) ... [2021-01-07 00:15:42,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 00:15:42,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 00:15:42,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 00:15:42,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 00:15:42,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:15:42" (1/1) ... [2021-01-07 00:15:42,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:15:42" (1/1) ... [2021-01-07 00:15:42,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:15:42" (1/1) ... [2021-01-07 00:15:42,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:15:42" (1/1) ... [2021-01-07 00:15:42,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:15:42" (1/1) ... [2021-01-07 00:15:42,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:15:42" (1/1) ... [2021-01-07 00:15:42,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:15:42" (1/1) ... [2021-01-07 00:15:42,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 00:15:42,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 00:15:42,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 00:15:42,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 00:15:42,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:15:42" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 00:15:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-01-07 00:15:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-01-07 00:15:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-01-07 00:15:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 00:15:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 00:15:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 00:15:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 00:15:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 00:15:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 00:15:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 00:15:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 00:15:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 00:15:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-01-07 00:15:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 00:15:42,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 00:15:43,798 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-07 00:15:48,887 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !false; [2021-01-07 00:15:48,887 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume false; [2021-01-07 00:15:48,916 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 00:15:48,916 INFO L299 CfgBuilder]: Removed 434 assume(true) statements. [2021-01-07 00:15:48,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:15:48 BoogieIcfgContainer [2021-01-07 00:15:48,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 00:15:48,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 00:15:48,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 00:15:48,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 00:15:48,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 12:15:39" (1/3) ... [2021-01-07 00:15:48,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7749adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 12:15:48, skipping insertion in model container [2021-01-07 00:15:48,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:15:42" (2/3) ... [2021-01-07 00:15:48,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7749adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 12:15:48, skipping insertion in model container [2021-01-07 00:15:48,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:15:48" (3/3) ... [2021-01-07 00:15:48,930 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-01-07 00:15:48,942 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 00:15:48,948 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2021-01-07 00:15:48,970 INFO L253 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-01-07 00:15:49,023 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 00:15:49,024 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 00:15:49,024 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 00:15:49,024 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 00:15:49,024 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 00:15:49,024 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 00:15:49,025 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 00:15:49,025 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 00:15:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2021-01-07 00:15:49,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 00:15:49,070 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:49,071 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:49,074 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]=== [2021-01-07 00:15:49,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:49,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1465825715, now seen corresponding path program 1 times [2021-01-07 00:15:49,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:49,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385537483] [2021-01-07 00:15:49,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:49,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:49,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385537483] [2021-01-07 00:15:49,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:49,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 00:15:49,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976804371] [2021-01-07 00:15:49,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 00:15:49,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:49,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 00:15:49,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:15:49,685 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 3 states. [2021-01-07 00:15:49,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:49,899 INFO L93 Difference]: Finished difference Result 1189 states and 1749 transitions. [2021-01-07 00:15:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 00:15:49,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2021-01-07 00:15:49,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:49,921 INFO L225 Difference]: With dead ends: 1189 [2021-01-07 00:15:49,922 INFO L226 Difference]: Without dead ends: 765 [2021-01-07 00:15:49,928 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 [2021-01-07 00:15:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2021-01-07 00:15:50,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 747. [2021-01-07 00:15:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2021-01-07 00:15:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 977 transitions. [2021-01-07 00:15:50,028 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 977 transitions. Word has length 10 [2021-01-07 00:15:50,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:50,029 INFO L481 AbstractCegarLoop]: Abstraction has 747 states and 977 transitions. [2021-01-07 00:15:50,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 00:15:50,029 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 977 transitions. [2021-01-07 00:15:50,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-07 00:15:50,030 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:50,030 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:50,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 00:15:50,030 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]=== [2021-01-07 00:15:50,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:50,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1804042980, now seen corresponding path program 1 times [2021-01-07 00:15:50,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:50,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230184238] [2021-01-07 00:15:50,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:50,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230184238] [2021-01-07 00:15:50,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:50,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 00:15:50,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360726728] [2021-01-07 00:15:50,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 00:15:50,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:50,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 00:15:50,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:15:50,207 INFO L87 Difference]: Start difference. First operand 747 states and 977 transitions. Second operand 3 states. [2021-01-07 00:15:50,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:50,290 INFO L93 Difference]: Finished difference Result 2217 states and 2904 transitions. [2021-01-07 00:15:50,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 00:15:50,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2021-01-07 00:15:50,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:50,299 INFO L225 Difference]: With dead ends: 2217 [2021-01-07 00:15:50,300 INFO L226 Difference]: Without dead ends: 1475 [2021-01-07 00:15:50,304 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 [2021-01-07 00:15:50,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2021-01-07 00:15:50,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1446. [2021-01-07 00:15:50,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1446 states. [2021-01-07 00:15:50,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1903 transitions. [2021-01-07 00:15:50,408 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1903 transitions. Word has length 11 [2021-01-07 00:15:50,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:50,409 INFO L481 AbstractCegarLoop]: Abstraction has 1446 states and 1903 transitions. [2021-01-07 00:15:50,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 00:15:50,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1903 transitions. [2021-01-07 00:15:50,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-07 00:15:50,414 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:50,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] [2021-01-07 00:15:50,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 00:15:50,415 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]=== [2021-01-07 00:15:50,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:50,417 INFO L82 PathProgramCache]: Analyzing trace with hash 739890622, now seen corresponding path program 1 times [2021-01-07 00:15:50,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:50,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990984986] [2021-01-07 00:15:50,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:50,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990984986] [2021-01-07 00:15:50,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:50,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 00:15:50,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584036396] [2021-01-07 00:15:50,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 00:15:50,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:50,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 00:15:50,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:15:50,659 INFO L87 Difference]: Start difference. First operand 1446 states and 1903 transitions. Second operand 3 states. [2021-01-07 00:15:50,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:50,800 INFO L93 Difference]: Finished difference Result 3924 states and 5208 transitions. [2021-01-07 00:15:50,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 00:15:50,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2021-01-07 00:15:50,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:50,814 INFO L225 Difference]: With dead ends: 3924 [2021-01-07 00:15:50,814 INFO L226 Difference]: Without dead ends: 2485 [2021-01-07 00:15:50,817 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:15:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2021-01-07 00:15:50,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2453. [2021-01-07 00:15:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2453 states. [2021-01-07 00:15:50,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3277 transitions. [2021-01-07 00:15:50,915 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3277 transitions. Word has length 38 [2021-01-07 00:15:50,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:50,915 INFO L481 AbstractCegarLoop]: Abstraction has 2453 states and 3277 transitions. [2021-01-07 00:15:50,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 00:15:50,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3277 transitions. [2021-01-07 00:15:50,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-07 00:15:50,923 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:50,923 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] [2021-01-07 00:15:50,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 00:15:50,924 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]=== [2021-01-07 00:15:50,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:50,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1309389857, now seen corresponding path program 1 times [2021-01-07 00:15:50,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:50,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657563991] [2021-01-07 00:15:50,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:51,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657563991] [2021-01-07 00:15:51,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:51,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:15:51,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433931813] [2021-01-07 00:15:51,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:15:51,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:51,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:15:51,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:15:51,100 INFO L87 Difference]: Start difference. First operand 2453 states and 3277 transitions. Second operand 4 states. [2021-01-07 00:15:51,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:51,385 INFO L93 Difference]: Finished difference Result 7327 states and 9781 transitions. [2021-01-07 00:15:51,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:15:51,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2021-01-07 00:15:51,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:51,410 INFO L225 Difference]: With dead ends: 7327 [2021-01-07 00:15:51,411 INFO L226 Difference]: Without dead ends: 4882 [2021-01-07 00:15:51,415 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 [2021-01-07 00:15:51,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states. [2021-01-07 00:15:51,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 2469. [2021-01-07 00:15:51,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2469 states. [2021-01-07 00:15:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3293 transitions. [2021-01-07 00:15:51,568 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3293 transitions. Word has length 41 [2021-01-07 00:15:51,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:51,569 INFO L481 AbstractCegarLoop]: Abstraction has 2469 states and 3293 transitions. [2021-01-07 00:15:51,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:15:51,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3293 transitions. [2021-01-07 00:15:51,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 00:15:51,570 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:51,571 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] [2021-01-07 00:15:51,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 00:15:51,571 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]=== [2021-01-07 00:15:51,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:51,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1996940455, now seen corresponding path program 1 times [2021-01-07 00:15:51,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:51,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57694992] [2021-01-07 00:15:51,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:51,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57694992] [2021-01-07 00:15:51,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:51,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 00:15:51,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482589540] [2021-01-07 00:15:51,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:15:51,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:51,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:15:51,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:15:51,774 INFO L87 Difference]: Start difference. First operand 2469 states and 3293 transitions. Second operand 6 states. [2021-01-07 00:15:52,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:52,310 INFO L93 Difference]: Finished difference Result 10245 states and 13645 transitions. [2021-01-07 00:15:52,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 00:15:52,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2021-01-07 00:15:52,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:52,349 INFO L225 Difference]: With dead ends: 10245 [2021-01-07 00:15:52,350 INFO L226 Difference]: Without dead ends: 7784 [2021-01-07 00:15:52,358 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-01-07 00:15:52,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7784 states. [2021-01-07 00:15:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7784 to 2485. [2021-01-07 00:15:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2485 states. [2021-01-07 00:15:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 3309 transitions. [2021-01-07 00:15:52,571 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 3309 transitions. Word has length 42 [2021-01-07 00:15:52,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:52,572 INFO L481 AbstractCegarLoop]: Abstraction has 2485 states and 3309 transitions. [2021-01-07 00:15:52,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:15:52,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 3309 transitions. [2021-01-07 00:15:52,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 00:15:52,573 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:52,574 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] [2021-01-07 00:15:52,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 00:15:52,574 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]=== [2021-01-07 00:15:52,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:52,575 INFO L82 PathProgramCache]: Analyzing trace with hash -942849768, now seen corresponding path program 1 times [2021-01-07 00:15:52,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:52,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204938911] [2021-01-07 00:15:52,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:52,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204938911] [2021-01-07 00:15:52,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:52,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:15:52,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126566876] [2021-01-07 00:15:52,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:15:52,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:52,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:15:52,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:15:52,787 INFO L87 Difference]: Start difference. First operand 2485 states and 3309 transitions. Second operand 5 states. [2021-01-07 00:15:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:53,996 INFO L93 Difference]: Finished difference Result 13586 states and 18045 transitions. [2021-01-07 00:15:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 00:15:53,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2021-01-07 00:15:53,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:54,080 INFO L225 Difference]: With dead ends: 13586 [2021-01-07 00:15:54,080 INFO L226 Difference]: Without dead ends: 12316 [2021-01-07 00:15:54,092 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 [2021-01-07 00:15:54,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12316 states. [2021-01-07 00:15:54,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12316 to 2545. [2021-01-07 00:15:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2545 states. [2021-01-07 00:15:54,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 3369 transitions. [2021-01-07 00:15:54,452 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 3369 transitions. Word has length 42 [2021-01-07 00:15:54,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:54,458 INFO L481 AbstractCegarLoop]: Abstraction has 2545 states and 3369 transitions. [2021-01-07 00:15:54,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:15:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 3369 transitions. [2021-01-07 00:15:54,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 00:15:54,459 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:54,460 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] [2021-01-07 00:15:54,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 00:15:54,460 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]=== [2021-01-07 00:15:54,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:54,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1763769626, now seen corresponding path program 1 times [2021-01-07 00:15:54,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:54,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515775027] [2021-01-07 00:15:54,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:54,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515775027] [2021-01-07 00:15:54,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:54,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 00:15:54,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9481437] [2021-01-07 00:15:54,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 00:15:54,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:54,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 00:15:54,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:15:54,660 INFO L87 Difference]: Start difference. First operand 2545 states and 3369 transitions. Second operand 7 states. [2021-01-07 00:15:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:55,937 INFO L93 Difference]: Finished difference Result 7308 states and 9691 transitions. [2021-01-07 00:15:55,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-01-07 00:15:55,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2021-01-07 00:15:55,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:55,953 INFO L225 Difference]: With dead ends: 7308 [2021-01-07 00:15:55,953 INFO L226 Difference]: Without dead ends: 6008 [2021-01-07 00:15:55,959 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2021-01-07 00:15:55,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2021-01-07 00:15:56,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 2553. [2021-01-07 00:15:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2021-01-07 00:15:56,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3377 transitions. [2021-01-07 00:15:56,281 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3377 transitions. Word has length 42 [2021-01-07 00:15:56,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:56,283 INFO L481 AbstractCegarLoop]: Abstraction has 2553 states and 3377 transitions. [2021-01-07 00:15:56,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 00:15:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3377 transitions. [2021-01-07 00:15:56,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 00:15:56,285 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:56,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:56,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 00:15:56,285 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]=== [2021-01-07 00:15:56,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:56,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1882537444, now seen corresponding path program 1 times [2021-01-07 00:15:56,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:56,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371223065] [2021-01-07 00:15:56,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:56,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371223065] [2021-01-07 00:15:56,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:56,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:15:56,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906081254] [2021-01-07 00:15:56,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:15:56,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:56,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:15:56,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:15:56,398 INFO L87 Difference]: Start difference. First operand 2553 states and 3377 transitions. Second operand 4 states. [2021-01-07 00:15:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:57,195 INFO L93 Difference]: Finished difference Result 8726 states and 11554 transitions. [2021-01-07 00:15:57,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:15:57,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2021-01-07 00:15:57,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:57,217 INFO L225 Difference]: With dead ends: 8726 [2021-01-07 00:15:57,217 INFO L226 Difference]: Without dead ends: 6181 [2021-01-07 00:15:57,223 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 [2021-01-07 00:15:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6181 states. [2021-01-07 00:15:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6181 to 2291. [2021-01-07 00:15:57,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2021-01-07 00:15:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3015 transitions. [2021-01-07 00:15:57,502 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3015 transitions. Word has length 44 [2021-01-07 00:15:57,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:57,502 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3015 transitions. [2021-01-07 00:15:57,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:15:57,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3015 transitions. [2021-01-07 00:15:57,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 00:15:57,504 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:57,504 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:15:57,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 00:15:57,504 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]=== [2021-01-07 00:15:57,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:57,505 INFO L82 PathProgramCache]: Analyzing trace with hash -297582244, now seen corresponding path program 1 times [2021-01-07 00:15:57,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:57,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566916819] [2021-01-07 00:15:57,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:57,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566916819] [2021-01-07 00:15:57,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:57,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 00:15:57,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296806691] [2021-01-07 00:15:57,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:15:57,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:57,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:15:57,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:15:57,632 INFO L87 Difference]: Start difference. First operand 2291 states and 3015 transitions. Second operand 4 states. [2021-01-07 00:15:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:58,521 INFO L93 Difference]: Finished difference Result 3590 states and 4725 transitions. [2021-01-07 00:15:58,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:15:58,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2021-01-07 00:15:58,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:58,529 INFO L225 Difference]: With dead ends: 3590 [2021-01-07 00:15:58,530 INFO L226 Difference]: Without dead ends: 3575 [2021-01-07 00:15:58,531 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 [2021-01-07 00:15:58,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3575 states. [2021-01-07 00:15:58,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3575 to 3547. [2021-01-07 00:15:58,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3547 states. [2021-01-07 00:15:58,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 4677 transitions. [2021-01-07 00:15:58,957 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 4677 transitions. Word has length 44 [2021-01-07 00:15:58,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:58,958 INFO L481 AbstractCegarLoop]: Abstraction has 3547 states and 4677 transitions. [2021-01-07 00:15:58,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:15:58,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 4677 transitions. [2021-01-07 00:15:58,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-07 00:15:58,959 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:58,959 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] [2021-01-07 00:15:58,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 00:15:58,960 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]=== [2021-01-07 00:15:58,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:58,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1289306960, now seen corresponding path program 1 times [2021-01-07 00:15:58,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:58,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56853230] [2021-01-07 00:15:58,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:15:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:15:59,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56853230] [2021-01-07 00:15:59,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:15:59,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 00:15:59,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764328609] [2021-01-07 00:15:59,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 00:15:59,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:15:59,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 00:15:59,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:15:59,069 INFO L87 Difference]: Start difference. First operand 3547 states and 4677 transitions. Second operand 3 states. [2021-01-07 00:15:59,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:15:59,475 INFO L93 Difference]: Finished difference Result 7164 states and 9501 transitions. [2021-01-07 00:15:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 00:15:59,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2021-01-07 00:15:59,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:15:59,485 INFO L225 Difference]: With dead ends: 7164 [2021-01-07 00:15:59,485 INFO L226 Difference]: Without dead ends: 3625 [2021-01-07 00:15:59,491 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:15:59,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3625 states. [2021-01-07 00:15:59,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3625 to 3625. [2021-01-07 00:15:59,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3625 states. [2021-01-07 00:15:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 4755 transitions. [2021-01-07 00:15:59,925 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 4755 transitions. Word has length 47 [2021-01-07 00:15:59,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:15:59,925 INFO L481 AbstractCegarLoop]: Abstraction has 3625 states and 4755 transitions. [2021-01-07 00:15:59,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 00:15:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 4755 transitions. [2021-01-07 00:15:59,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-07 00:15:59,926 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:15:59,927 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] [2021-01-07 00:15:59,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 00:15:59,927 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]=== [2021-01-07 00:15:59,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:15:59,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1848487698, now seen corresponding path program 1 times [2021-01-07 00:15:59,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:15:59,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470471207] [2021-01-07 00:15:59,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:15:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:16:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 00:16:00,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470471207] [2021-01-07 00:16:00,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:16:00,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 00:16:00,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721613290] [2021-01-07 00:16:00,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 00:16:00,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:16:00,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 00:16:00,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:16:00,078 INFO L87 Difference]: Start difference. First operand 3625 states and 4755 transitions. Second operand 7 states. [2021-01-07 00:16:01,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:16:01,959 INFO L93 Difference]: Finished difference Result 11844 states and 15579 transitions. [2021-01-07 00:16:01,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-07 00:16:01,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2021-01-07 00:16:01,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:16:01,980 INFO L225 Difference]: With dead ends: 11844 [2021-01-07 00:16:01,981 INFO L226 Difference]: Without dead ends: 9228 [2021-01-07 00:16:01,987 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 [2021-01-07 00:16:02,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9228 states. [2021-01-07 00:16:02,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9228 to 3641. [2021-01-07 00:16:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2021-01-07 00:16:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 4771 transitions. [2021-01-07 00:16:02,384 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 4771 transitions. Word has length 48 [2021-01-07 00:16:02,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:16:02,384 INFO L481 AbstractCegarLoop]: Abstraction has 3641 states and 4771 transitions. [2021-01-07 00:16:02,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 00:16:02,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 4771 transitions. [2021-01-07 00:16:02,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-07 00:16:02,386 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:16:02,386 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] [2021-01-07 00:16:02,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 00:16:02,386 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]=== [2021-01-07 00:16:02,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:16:02,387 INFO L82 PathProgramCache]: Analyzing trace with hash -6937233, now seen corresponding path program 1 times [2021-01-07 00:16:02,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:16:02,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543060943] [2021-01-07 00:16:02,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:16:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:16:02,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 00:16:02,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543060943] [2021-01-07 00:16:02,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:16:02,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:16:02,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618306374] [2021-01-07 00:16:02,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:16:02,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:16:02,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:16:02,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:16:02,501 INFO L87 Difference]: Start difference. First operand 3641 states and 4771 transitions. Second operand 4 states. [2021-01-07 00:16:03,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:16:03,402 INFO L93 Difference]: Finished difference Result 11655 states and 15280 transitions. [2021-01-07 00:16:03,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:16:03,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2021-01-07 00:16:03,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:16:03,418 INFO L225 Difference]: With dead ends: 11655 [2021-01-07 00:16:03,418 INFO L226 Difference]: Without dead ends: 8022 [2021-01-07 00:16:03,426 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 [2021-01-07 00:16:03,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8022 states. [2021-01-07 00:16:03,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8022 to 3079. [2021-01-07 00:16:03,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3079 states. [2021-01-07 00:16:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3079 states to 3079 states and 4025 transitions. [2021-01-07 00:16:03,852 INFO L78 Accepts]: Start accepts. Automaton has 3079 states and 4025 transitions. Word has length 52 [2021-01-07 00:16:03,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:16:03,852 INFO L481 AbstractCegarLoop]: Abstraction has 3079 states and 4025 transitions. [2021-01-07 00:16:03,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:16:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3079 states and 4025 transitions. [2021-01-07 00:16:03,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-07 00:16:03,854 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:16:03,854 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] [2021-01-07 00:16:03,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 00:16:03,854 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]=== [2021-01-07 00:16:03,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:16:03,855 INFO L82 PathProgramCache]: Analyzing trace with hash 291347065, now seen corresponding path program 1 times [2021-01-07 00:16:03,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:16:03,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247730771] [2021-01-07 00:16:03,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:16:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:16:03,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:16:03,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247730771] [2021-01-07 00:16:03,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:16:03,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:16:03,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901298181] [2021-01-07 00:16:03,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:16:03,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:16:03,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:16:03,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:16:03,966 INFO L87 Difference]: Start difference. First operand 3079 states and 4025 transitions. Second operand 4 states. [2021-01-07 00:16:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:16:04,981 INFO L93 Difference]: Finished difference Result 10255 states and 13390 transitions. [2021-01-07 00:16:04,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:16:04,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2021-01-07 00:16:04,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:16:04,994 INFO L225 Difference]: With dead ends: 10255 [2021-01-07 00:16:04,994 INFO L226 Difference]: Without dead ends: 7623 [2021-01-07 00:16:05,001 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 [2021-01-07 00:16:05,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7623 states. [2021-01-07 00:16:05,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7623 to 2871. [2021-01-07 00:16:05,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2871 states. [2021-01-07 00:16:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 3739 transitions. [2021-01-07 00:16:05,498 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 3739 transitions. Word has length 52 [2021-01-07 00:16:05,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:16:05,498 INFO L481 AbstractCegarLoop]: Abstraction has 2871 states and 3739 transitions. [2021-01-07 00:16:05,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:16:05,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 3739 transitions. [2021-01-07 00:16:05,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-07 00:16:05,500 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:16:05,500 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] [2021-01-07 00:16:05,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 00:16:05,501 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]=== [2021-01-07 00:16:05,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:16:05,501 INFO L82 PathProgramCache]: Analyzing trace with hash -729721289, now seen corresponding path program 1 times [2021-01-07 00:16:05,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:16:05,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229698528] [2021-01-07 00:16:05,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:16:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:16:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:16:05,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229698528] [2021-01-07 00:16:05,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:16:05,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:16:05,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526085185] [2021-01-07 00:16:05,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:16:05,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:16:05,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:16:05,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:16:05,622 INFO L87 Difference]: Start difference. First operand 2871 states and 3739 transitions. Second operand 5 states. [2021-01-07 00:16:07,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:16:07,786 INFO L93 Difference]: Finished difference Result 17188 states and 22486 transitions. [2021-01-07 00:16:07,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 00:16:07,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2021-01-07 00:16:07,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:16:07,806 INFO L225 Difference]: With dead ends: 17188 [2021-01-07 00:16:07,806 INFO L226 Difference]: Without dead ends: 15839 [2021-01-07 00:16:07,812 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 [2021-01-07 00:16:07,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15839 states. [2021-01-07 00:16:08,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15839 to 2919. [2021-01-07 00:16:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2919 states. [2021-01-07 00:16:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 3787 transitions. [2021-01-07 00:16:08,599 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 3787 transitions. Word has length 52 [2021-01-07 00:16:08,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:16:08,600 INFO L481 AbstractCegarLoop]: Abstraction has 2919 states and 3787 transitions. [2021-01-07 00:16:08,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:16:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 3787 transitions. [2021-01-07 00:16:08,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-07 00:16:08,602 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:16:08,602 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] [2021-01-07 00:16:08,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 00:16:08,602 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]=== [2021-01-07 00:16:08,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:16:08,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1876302265, now seen corresponding path program 1 times [2021-01-07 00:16:08,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:16:08,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823748654] [2021-01-07 00:16:08,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:16:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:16:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:16:08,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823748654] [2021-01-07 00:16:08,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:16:08,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 00:16:08,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461586044] [2021-01-07 00:16:08,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 00:16:08,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:16:08,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 00:16:08,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:16:08,705 INFO L87 Difference]: Start difference. First operand 2919 states and 3787 transitions. Second operand 3 states. [2021-01-07 00:16:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:16:09,335 INFO L93 Difference]: Finished difference Result 5465 states and 7096 transitions. [2021-01-07 00:16:09,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 00:16:09,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2021-01-07 00:16:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:16:09,339 INFO L225 Difference]: With dead ends: 5465 [2021-01-07 00:16:09,340 INFO L226 Difference]: Without dead ends: 4092 [2021-01-07 00:16:09,342 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:16:09,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4092 states. [2021-01-07 00:16:09,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4092 to 2927. [2021-01-07 00:16:09,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2927 states. [2021-01-07 00:16:09,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 3795 transitions. [2021-01-07 00:16:09,943 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 3795 transitions. Word has length 52 [2021-01-07 00:16:09,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:16:09,943 INFO L481 AbstractCegarLoop]: Abstraction has 2927 states and 3795 transitions. [2021-01-07 00:16:09,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 00:16:09,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 3795 transitions. [2021-01-07 00:16:09,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-07 00:16:09,945 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:16:09,945 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] [2021-01-07 00:16:09,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 00:16:09,946 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]=== [2021-01-07 00:16:09,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:16:09,946 INFO L82 PathProgramCache]: Analyzing trace with hash -873150611, now seen corresponding path program 1 times [2021-01-07 00:16:09,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:16:09,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240240651] [2021-01-07 00:16:09,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:16:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:16:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:16:10,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240240651] [2021-01-07 00:16:10,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:16:10,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 00:16:10,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122925152] [2021-01-07 00:16:10,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 00:16:10,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:16:10,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 00:16:10,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:16:10,150 INFO L87 Difference]: Start difference. First operand 2927 states and 3795 transitions. Second operand 9 states. [2021-01-07 00:16:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:16:14,108 INFO L93 Difference]: Finished difference Result 15400 states and 20063 transitions. [2021-01-07 00:16:14,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-01-07 00:16:14,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2021-01-07 00:16:14,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:16:14,125 INFO L225 Difference]: With dead ends: 15400 [2021-01-07 00:16:14,125 INFO L226 Difference]: Without dead ends: 12920 [2021-01-07 00:16:14,132 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=570, Invalid=2082, Unknown=0, NotChecked=0, Total=2652 [2021-01-07 00:16:14,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12920 states. [2021-01-07 00:16:14,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12920 to 2925. [2021-01-07 00:16:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2925 states. [2021-01-07 00:16:14,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 3781 transitions. [2021-01-07 00:16:14,621 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 3781 transitions. Word has length 53 [2021-01-07 00:16:14,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:16:14,621 INFO L481 AbstractCegarLoop]: Abstraction has 2925 states and 3781 transitions. [2021-01-07 00:16:14,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 00:16:14,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 3781 transitions. [2021-01-07 00:16:14,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-07 00:16:14,623 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:16:14,623 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] [2021-01-07 00:16:14,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 00:16:14,623 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]=== [2021-01-07 00:16:14,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:16:14,624 INFO L82 PathProgramCache]: Analyzing trace with hash 24644017, now seen corresponding path program 1 times [2021-01-07 00:16:14,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:16:14,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548442705] [2021-01-07 00:16:14,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:16:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:16:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:16:14,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548442705] [2021-01-07 00:16:14,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:16:14,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:16:14,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108431364] [2021-01-07 00:16:14,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:16:14,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:16:14,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:16:14,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:16:14,723 INFO L87 Difference]: Start difference. First operand 2925 states and 3781 transitions. Second operand 4 states. [2021-01-07 00:16:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:16:15,791 INFO L93 Difference]: Finished difference Result 5861 states and 7575 transitions. [2021-01-07 00:16:15,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:16:15,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2021-01-07 00:16:15,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:16:15,794 INFO L225 Difference]: With dead ends: 5861 [2021-01-07 00:16:15,794 INFO L226 Difference]: Without dead ends: 2942 [2021-01-07 00:16:15,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:16:15,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2021-01-07 00:16:16,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2929. [2021-01-07 00:16:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2929 states. [2021-01-07 00:16:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 3784 transitions. [2021-01-07 00:16:16,197 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 3784 transitions. Word has length 53 [2021-01-07 00:16:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:16:16,198 INFO L481 AbstractCegarLoop]: Abstraction has 2929 states and 3784 transitions. [2021-01-07 00:16:16,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:16:16,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 3784 transitions. [2021-01-07 00:16:16,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-07 00:16:16,199 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:16:16,199 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] [2021-01-07 00:16:16,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 00:16:16,200 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]=== [2021-01-07 00:16:16,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:16:16,200 INFO L82 PathProgramCache]: Analyzing trace with hash 446058872, now seen corresponding path program 1 times [2021-01-07 00:16:16,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:16:16,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749927110] [2021-01-07 00:16:16,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:16:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:16:16,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:16:16,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749927110] [2021-01-07 00:16:16,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:16:16,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 00:16:16,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194656116] [2021-01-07 00:16:16,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:16:16,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:16:16,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:16:16,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:16:16,326 INFO L87 Difference]: Start difference. First operand 2929 states and 3784 transitions. Second operand 4 states. [2021-01-07 00:16:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:16:17,228 INFO L93 Difference]: Finished difference Result 4319 states and 5567 transitions. [2021-01-07 00:16:17,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:16:17,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2021-01-07 00:16:17,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:16:17,232 INFO L225 Difference]: With dead ends: 4319 [2021-01-07 00:16:17,232 INFO L226 Difference]: Without dead ends: 4313 [2021-01-07 00:16:17,233 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 [2021-01-07 00:16:17,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2021-01-07 00:16:17,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4267. [2021-01-07 00:16:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4267 states. [2021-01-07 00:16:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 5520 transitions. [2021-01-07 00:16:17,856 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 5520 transitions. Word has length 54 [2021-01-07 00:16:17,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:16:17,856 INFO L481 AbstractCegarLoop]: Abstraction has 4267 states and 5520 transitions. [2021-01-07 00:16:17,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:16:17,856 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 5520 transitions. [2021-01-07 00:16:17,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-07 00:16:17,857 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:16:17,857 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] [2021-01-07 00:16:17,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 00:16:17,858 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]=== [2021-01-07 00:16:17,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:16:17,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1584391570, now seen corresponding path program 1 times [2021-01-07 00:16:17,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:16:17,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093582138] [2021-01-07 00:16:17,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:16:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:16:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 00:16:18,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093582138] [2021-01-07 00:16:18,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:16:18,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:16:18,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989722679] [2021-01-07 00:16:18,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:16:18,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:16:18,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:16:18,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:16:18,219 INFO L87 Difference]: Start difference. First operand 4267 states and 5520 transitions. Second operand 4 states. [2021-01-07 00:16:19,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:16:19,426 INFO L93 Difference]: Finished difference Result 8528 states and 11033 transitions. [2021-01-07 00:16:19,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:16:19,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2021-01-07 00:16:19,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:16:19,433 INFO L225 Difference]: With dead ends: 8528 [2021-01-07 00:16:19,433 INFO L226 Difference]: Without dead ends: 4267 [2021-01-07 00:16:19,439 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:16:19,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2021-01-07 00:16:20,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 4267. [2021-01-07 00:16:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4267 states. [2021-01-07 00:16:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 5519 transitions. [2021-01-07 00:16:20,018 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 5519 transitions. Word has length 55 [2021-01-07 00:16:20,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:16:20,018 INFO L481 AbstractCegarLoop]: Abstraction has 4267 states and 5519 transitions. [2021-01-07 00:16:20,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:16:20,018 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 5519 transitions. [2021-01-07 00:16:20,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-07 00:16:20,019 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:16:20,019 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] [2021-01-07 00:16:20,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 00:16:20,020 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]=== [2021-01-07 00:16:20,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:16:20,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1103311312, now seen corresponding path program 1 times [2021-01-07 00:16:20,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:16:20,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750346546] [2021-01-07 00:16:20,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:16:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:16:20,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 00:16:20,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750346546] [2021-01-07 00:16:20,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:16:20,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 00:16:20,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959509154] [2021-01-07 00:16:20,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:16:20,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:16:20,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:16:20,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:16:20,296 INFO L87 Difference]: Start difference. First operand 4267 states and 5519 transitions. Second operand 4 states. [2021-01-07 00:16:22,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:16:22,357 INFO L93 Difference]: Finished difference Result 11106 states and 14408 transitions. [2021-01-07 00:16:22,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:16:22,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2021-01-07 00:16:22,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:16:22,369 INFO L225 Difference]: With dead ends: 11106 [2021-01-07 00:16:22,370 INFO L226 Difference]: Without dead ends: 9158 [2021-01-07 00:16:22,375 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 [2021-01-07 00:16:22,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9158 states. [2021-01-07 00:16:23,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9158 to 9007. [2021-01-07 00:16:23,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9007 states. [2021-01-07 00:16:23,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9007 states to 9007 states and 11681 transitions. [2021-01-07 00:16:23,739 INFO L78 Accepts]: Start accepts. Automaton has 9007 states and 11681 transitions. Word has length 55 [2021-01-07 00:16:23,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:16:23,740 INFO L481 AbstractCegarLoop]: Abstraction has 9007 states and 11681 transitions. [2021-01-07 00:16:23,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:16:23,740 INFO L276 IsEmpty]: Start isEmpty. Operand 9007 states and 11681 transitions. [2021-01-07 00:16:23,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-07 00:16:23,741 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:16:23,741 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] [2021-01-07 00:16:23,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 00:16:23,742 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]=== [2021-01-07 00:16:23,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:16:23,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1514792705, now seen corresponding path program 1 times [2021-01-07 00:16:23,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:16:23,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185813465] [2021-01-07 00:16:23,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:16:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:16:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:16:23,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185813465] [2021-01-07 00:16:23,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:16:23,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 00:16:23,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565053855] [2021-01-07 00:16:23,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 00:16:23,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:16:23,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 00:16:23,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:16:23,869 INFO L87 Difference]: Start difference. First operand 9007 states and 11681 transitions. Second operand 7 states. [2021-01-07 00:16:37,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:16:37,642 INFO L93 Difference]: Finished difference Result 76339 states and 100137 transitions. [2021-01-07 00:16:37,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-07 00:16:37,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2021-01-07 00:16:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:16:37,736 INFO L225 Difference]: With dead ends: 76339 [2021-01-07 00:16:37,736 INFO L226 Difference]: Without dead ends: 68797 [2021-01-07 00:16:37,759 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 [2021-01-07 00:16:37,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68797 states. [2021-01-07 00:16:40,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68797 to 8971. [2021-01-07 00:16:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8971 states. [2021-01-07 00:16:40,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8971 states to 8971 states and 11591 transitions. [2021-01-07 00:16:40,111 INFO L78 Accepts]: Start accepts. Automaton has 8971 states and 11591 transitions. Word has length 56 [2021-01-07 00:16:40,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:16:40,111 INFO L481 AbstractCegarLoop]: Abstraction has 8971 states and 11591 transitions. [2021-01-07 00:16:40,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 00:16:40,112 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 11591 transitions. [2021-01-07 00:16:40,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-07 00:16:40,113 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:16:40,114 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] [2021-01-07 00:16:40,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-07 00:16:40,114 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]=== [2021-01-07 00:16:40,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:16:40,115 INFO L82 PathProgramCache]: Analyzing trace with hash 850396480, now seen corresponding path program 1 times [2021-01-07 00:16:40,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:16:40,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094266803] [2021-01-07 00:16:40,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:16:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:16:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:16:40,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094266803] [2021-01-07 00:16:40,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:16:40,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:16:40,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895293692] [2021-01-07 00:16:40,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:16:40,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:16:40,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:16:40,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:16:40,233 INFO L87 Difference]: Start difference. First operand 8971 states and 11591 transitions. Second operand 5 states. [2021-01-07 00:16:45,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:16:45,537 INFO L93 Difference]: Finished difference Result 24328 states and 31604 transitions. [2021-01-07 00:16:45,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 00:16:45,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2021-01-07 00:16:45,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:16:45,557 INFO L225 Difference]: With dead ends: 24328 [2021-01-07 00:16:45,557 INFO L226 Difference]: Without dead ends: 15359 [2021-01-07 00:16:45,568 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 [2021-01-07 00:16:45,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15359 states. [2021-01-07 00:16:47,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15359 to 8980. [2021-01-07 00:16:47,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8980 states. [2021-01-07 00:16:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8980 states to 8980 states and 11598 transitions. [2021-01-07 00:16:47,306 INFO L78 Accepts]: Start accepts. Automaton has 8980 states and 11598 transitions. Word has length 58 [2021-01-07 00:16:47,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:16:47,306 INFO L481 AbstractCegarLoop]: Abstraction has 8980 states and 11598 transitions. [2021-01-07 00:16:47,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:16:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 8980 states and 11598 transitions. [2021-01-07 00:16:47,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-07 00:16:47,307 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:16:47,307 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] [2021-01-07 00:16:47,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-07 00:16:47,308 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]=== [2021-01-07 00:16:47,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:16:47,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1274043202, now seen corresponding path program 1 times [2021-01-07 00:16:47,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:16:47,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606448117] [2021-01-07 00:16:47,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:16:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:16:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:16:47,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606448117] [2021-01-07 00:16:47,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:16:47,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 00:16:47,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994199620] [2021-01-07 00:16:47,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 00:16:47,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:16:47,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 00:16:47,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:16:47,414 INFO L87 Difference]: Start difference. First operand 8980 states and 11598 transitions. Second operand 3 states. [2021-01-07 00:16:49,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:16:49,358 INFO L93 Difference]: Finished difference Result 18000 states and 23252 transitions. [2021-01-07 00:16:49,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 00:16:49,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2021-01-07 00:16:49,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:16:49,368 INFO L225 Difference]: With dead ends: 18000 [2021-01-07 00:16:49,368 INFO L226 Difference]: Without dead ends: 9028 [2021-01-07 00:16:49,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 [2021-01-07 00:16:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9028 states. [2021-01-07 00:16:51,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9028 to 9012. [2021-01-07 00:16:51,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9012 states. [2021-01-07 00:16:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9012 states to 9012 states and 11630 transitions. [2021-01-07 00:16:51,186 INFO L78 Accepts]: Start accepts. Automaton has 9012 states and 11630 transitions. Word has length 58 [2021-01-07 00:16:51,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:16:51,186 INFO L481 AbstractCegarLoop]: Abstraction has 9012 states and 11630 transitions. [2021-01-07 00:16:51,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 00:16:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 9012 states and 11630 transitions. [2021-01-07 00:16:51,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-07 00:16:51,188 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:16:51,188 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] [2021-01-07 00:16:51,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-07 00:16:51,188 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]=== [2021-01-07 00:16:51,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:16:51,189 INFO L82 PathProgramCache]: Analyzing trace with hash -361538827, now seen corresponding path program 1 times [2021-01-07 00:16:51,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:16:51,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714968147] [2021-01-07 00:16:51,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:16:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:16:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 00:16:51,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714968147] [2021-01-07 00:16:51,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:16:51,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:16:51,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918620291] [2021-01-07 00:16:51,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:16:51,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:16:51,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:16:51,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:16:51,294 INFO L87 Difference]: Start difference. First operand 9012 states and 11630 transitions. Second operand 4 states. [2021-01-07 00:16:56,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:16:56,234 INFO L93 Difference]: Finished difference Result 34083 states and 43728 transitions. [2021-01-07 00:16:56,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:16:56,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2021-01-07 00:16:56,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:16:56,265 INFO L225 Difference]: With dead ends: 34083 [2021-01-07 00:16:56,265 INFO L226 Difference]: Without dead ends: 25079 [2021-01-07 00:16:56,277 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 [2021-01-07 00:16:56,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25079 states. [2021-01-07 00:16:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25079 to 9076. [2021-01-07 00:16:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9076 states. [2021-01-07 00:16:58,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9076 states to 9076 states and 11694 transitions. [2021-01-07 00:16:58,216 INFO L78 Accepts]: Start accepts. Automaton has 9076 states and 11694 transitions. Word has length 60 [2021-01-07 00:16:58,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:16:58,216 INFO L481 AbstractCegarLoop]: Abstraction has 9076 states and 11694 transitions. [2021-01-07 00:16:58,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:16:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 9076 states and 11694 transitions. [2021-01-07 00:16:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-07 00:16:58,218 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:16:58,218 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] [2021-01-07 00:16:58,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-07 00:16:58,218 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]=== [2021-01-07 00:16:58,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:16:58,219 INFO L82 PathProgramCache]: Analyzing trace with hash 772416922, now seen corresponding path program 1 times [2021-01-07 00:16:58,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:16:58,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670132652] [2021-01-07 00:16:58,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:16:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:16:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 00:16:58,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670132652] [2021-01-07 00:16:58,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:16:58,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:16:58,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153136724] [2021-01-07 00:16:58,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:16:58,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:16:58,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:16:58,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:16:58,342 INFO L87 Difference]: Start difference. First operand 9076 states and 11694 transitions. Second operand 4 states. [2021-01-07 00:17:03,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:17:03,808 INFO L93 Difference]: Finished difference Result 31979 states and 41228 transitions. [2021-01-07 00:17:03,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:17:03,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2021-01-07 00:17:03,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:17:03,837 INFO L225 Difference]: With dead ends: 31979 [2021-01-07 00:17:03,837 INFO L226 Difference]: Without dead ends: 24398 [2021-01-07 00:17:03,848 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 [2021-01-07 00:17:03,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24398 states. [2021-01-07 00:17:05,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24398 to 8951. [2021-01-07 00:17:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8951 states. [2021-01-07 00:17:05,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8951 states to 8951 states and 11527 transitions. [2021-01-07 00:17:05,855 INFO L78 Accepts]: Start accepts. Automaton has 8951 states and 11527 transitions. Word has length 60 [2021-01-07 00:17:05,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:17:05,855 INFO L481 AbstractCegarLoop]: Abstraction has 8951 states and 11527 transitions. [2021-01-07 00:17:05,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:17:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 8951 states and 11527 transitions. [2021-01-07 00:17:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-07 00:17:05,857 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:17:05,857 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] [2021-01-07 00:17:05,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-07 00:17:05,857 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]=== [2021-01-07 00:17:05,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:17:05,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2037876465, now seen corresponding path program 1 times [2021-01-07 00:17:05,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:17:05,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426743041] [2021-01-07 00:17:05,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:17:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:17:05,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:17:05,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426743041] [2021-01-07 00:17:05,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796142158] [2021-01-07 00:17:05,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:17:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:17:06,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 00:17:06,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:17:06,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:17:06,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 00:17:06,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-01-07 00:17:06,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881436815] [2021-01-07 00:17:06,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:17:06,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:17:06,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:17:06,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:17:06,678 INFO L87 Difference]: Start difference. First operand 8951 states and 11527 transitions. Second operand 6 states. [2021-01-07 00:17:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:17:09,527 INFO L93 Difference]: Finished difference Result 18102 states and 23462 transitions. [2021-01-07 00:17:09,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:17:09,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2021-01-07 00:17:09,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:17:09,544 INFO L225 Difference]: With dead ends: 18102 [2021-01-07 00:17:09,544 INFO L226 Difference]: Without dead ends: 9159 [2021-01-07 00:17:09,552 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 [2021-01-07 00:17:09,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9159 states. [2021-01-07 00:17:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9159 to 9159. [2021-01-07 00:17:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9159 states. [2021-01-07 00:17:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9159 states to 9159 states and 11735 transitions. [2021-01-07 00:17:11,785 INFO L78 Accepts]: Start accepts. Automaton has 9159 states and 11735 transitions. Word has length 61 [2021-01-07 00:17:11,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:17:11,785 INFO L481 AbstractCegarLoop]: Abstraction has 9159 states and 11735 transitions. [2021-01-07 00:17:11,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:17:11,785 INFO L276 IsEmpty]: Start isEmpty. Operand 9159 states and 11735 transitions. [2021-01-07 00:17:11,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-07 00:17:11,787 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:17:11,787 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] [2021-01-07 00:17:12,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-01-07 00:17:12,001 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]=== [2021-01-07 00:17:12,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:17:12,002 INFO L82 PathProgramCache]: Analyzing trace with hash 306863343, now seen corresponding path program 1 times [2021-01-07 00:17:12,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:17:12,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268188881] [2021-01-07 00:17:12,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:17:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:17:12,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:17:12,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268188881] [2021-01-07 00:17:12,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162961615] [2021-01-07 00:17:12,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:17:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:17:12,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 00:17:12,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:17:12,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:17:12,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 00:17:12,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-07 00:17:12,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741521900] [2021-01-07 00:17:12,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:17:12,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:17:12,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:17:12,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:17:12,683 INFO L87 Difference]: Start difference. First operand 9159 states and 11735 transitions. Second operand 5 states. [2021-01-07 00:17:14,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:17:14,761 INFO L93 Difference]: Finished difference Result 18374 states and 23542 transitions. [2021-01-07 00:17:14,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:17:14,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2021-01-07 00:17:14,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:17:14,780 INFO L225 Difference]: With dead ends: 18374 [2021-01-07 00:17:14,780 INFO L226 Difference]: Without dead ends: 9223 [2021-01-07 00:17:14,792 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 [2021-01-07 00:17:14,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2021-01-07 00:17:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 9207. [2021-01-07 00:17:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9207 states. [2021-01-07 00:17:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9207 states to 9207 states and 11783 transitions. [2021-01-07 00:17:16,962 INFO L78 Accepts]: Start accepts. Automaton has 9207 states and 11783 transitions. Word has length 61 [2021-01-07 00:17:16,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:17:16,962 INFO L481 AbstractCegarLoop]: Abstraction has 9207 states and 11783 transitions. [2021-01-07 00:17:16,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:17:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 9207 states and 11783 transitions. [2021-01-07 00:17:16,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-07 00:17:16,964 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:17:16,964 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] [2021-01-07 00:17:17,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-01-07 00:17:17,179 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]=== [2021-01-07 00:17:17,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:17:17,180 INFO L82 PathProgramCache]: Analyzing trace with hash -113453997, now seen corresponding path program 2 times [2021-01-07 00:17:17,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:17:17,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986404134] [2021-01-07 00:17:17,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:17:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:17:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:17:17,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986404134] [2021-01-07 00:17:17,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845109763] [2021-01-07 00:17:17,299 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 [2021-01-07 00:17:17,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-07 00:17:17,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 00:17:17,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-07 00:17:17,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:17:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 00:17:17,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 00:17:17,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2021-01-07 00:17:17,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603092241] [2021-01-07 00:17:17,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 00:17:17,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:17:17,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 00:17:17,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-01-07 00:17:17,929 INFO L87 Difference]: Start difference. First operand 9207 states and 11783 transitions. Second operand 8 states. [2021-01-07 00:17:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:17:39,164 INFO L93 Difference]: Finished difference Result 83091 states and 108221 transitions. [2021-01-07 00:17:39,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-01-07 00:17:39,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2021-01-07 00:17:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:17:39,282 INFO L225 Difference]: With dead ends: 83091 [2021-01-07 00:17:39,283 INFO L226 Difference]: Without dead ends: 73892 [2021-01-07 00:17:39,312 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=346, Invalid=1376, Unknown=0, NotChecked=0, Total=1722 [2021-01-07 00:17:39,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73892 states. [2021-01-07 00:17:42,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73892 to 9063. [2021-01-07 00:17:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9063 states. [2021-01-07 00:17:42,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 11523 transitions. [2021-01-07 00:17:42,550 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 11523 transitions. Word has length 62 [2021-01-07 00:17:42,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:17:42,550 INFO L481 AbstractCegarLoop]: Abstraction has 9063 states and 11523 transitions. [2021-01-07 00:17:42,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 00:17:42,550 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 11523 transitions. [2021-01-07 00:17:42,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-07 00:17:42,551 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:17:42,551 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] [2021-01-07 00:17:42,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-01-07 00:17:42,753 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]=== [2021-01-07 00:17:42,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:17:42,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1699998706, now seen corresponding path program 1 times [2021-01-07 00:17:42,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:17:42,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594024116] [2021-01-07 00:17:42,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:17:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:17:42,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:17:42,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594024116] [2021-01-07 00:17:42,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:17:42,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 00:17:42,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321171128] [2021-01-07 00:17:42,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 00:17:42,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:17:42,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 00:17:42,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:17:42,975 INFO L87 Difference]: Start difference. First operand 9063 states and 11523 transitions. Second operand 9 states. [2021-01-07 00:17:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:17:53,220 INFO L93 Difference]: Finished difference Result 33696 states and 42880 transitions. [2021-01-07 00:17:53,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-01-07 00:17:53,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2021-01-07 00:17:53,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:17:53,254 INFO L225 Difference]: With dead ends: 33696 [2021-01-07 00:17:53,255 INFO L226 Difference]: Without dead ends: 28121 [2021-01-07 00:17:53,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=570, Invalid=2082, Unknown=0, NotChecked=0, Total=2652 [2021-01-07 00:17:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28121 states. [2021-01-07 00:17:55,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28121 to 9037. [2021-01-07 00:17:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9037 states. [2021-01-07 00:17:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9037 states to 9037 states and 11465 transitions. [2021-01-07 00:17:55,897 INFO L78 Accepts]: Start accepts. Automaton has 9037 states and 11465 transitions. Word has length 62 [2021-01-07 00:17:55,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:17:55,898 INFO L481 AbstractCegarLoop]: Abstraction has 9037 states and 11465 transitions. [2021-01-07 00:17:55,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 00:17:55,898 INFO L276 IsEmpty]: Start isEmpty. Operand 9037 states and 11465 transitions. [2021-01-07 00:17:55,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-07 00:17:55,899 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:17:55,899 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] [2021-01-07 00:17:55,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-07 00:17:55,900 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]=== [2021-01-07 00:17:55,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:17:55,900 INFO L82 PathProgramCache]: Analyzing trace with hash -86443031, now seen corresponding path program 1 times [2021-01-07 00:17:55,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:17:55,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694767369] [2021-01-07 00:17:55,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:17:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-07 00:17:56,307 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-07 00:17:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-07 00:17:56,700 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-07 00:17:56,896 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-07 00:17:56,896 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-07 00:17:56,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-07 00:17:57,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 12:17:57 BoogieIcfgContainer [2021-01-07 00:17:57,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-07 00:17:57,225 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-07 00:17:57,225 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-07 00:17:57,226 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-07 00:17:57,226 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:15:48" (3/4) ... [2021-01-07 00:17:57,230 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-01-07 00:17:57,230 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-07 00:17:57,232 INFO L168 Benchmark]: Toolchain (without parser) took 137546.74 ms. Allocated memory was 151.0 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 116.8 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 645.0 MB. Max. memory is 8.0 GB. [2021-01-07 00:17:57,238 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 151.0 MB. Free memory is still 123.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-07 00:17:57,239 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2596.35 ms. Allocated memory was 151.0 MB in the beginning and 196.1 MB in the end (delta: 45.1 MB). Free memory was 116.6 MB in the beginning and 99.7 MB in the end (delta: 16.9 MB). Peak memory consumption was 80.3 MB. Max. memory is 8.0 GB. [2021-01-07 00:17:57,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 220.18 ms. Allocated memory is still 196.1 MB. Free memory was 99.7 MB in the beginning and 146.9 MB in the end (delta: -47.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-01-07 00:17:57,243 INFO L168 Benchmark]: Boogie Preprocessor took 261.53 ms. Allocated memory is still 196.1 MB. Free memory was 146.9 MB in the beginning and 132.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-01-07 00:17:57,243 INFO L168 Benchmark]: RCFGBuilder took 6134.43 ms. Allocated memory was 196.1 MB in the beginning and 252.7 MB in the end (delta: 56.6 MB). Free memory was 132.2 MB in the beginning and 179.2 MB in the end (delta: -47.0 MB). Peak memory consumption was 111.7 MB. Max. memory is 8.0 GB. [2021-01-07 00:17:57,244 INFO L168 Benchmark]: TraceAbstraction took 128302.74 ms. Allocated memory was 252.7 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 178.7 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 603.9 MB. Max. memory is 8.0 GB. [2021-01-07 00:17:57,244 INFO L168 Benchmark]: Witness Printer took 4.98 ms. Allocated memory is still 3.2 GB. Free memory is still 2.5 GB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-07 00:17:57,246 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 151.0 MB. Free memory is still 123.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 2596.35 ms. Allocated memory was 151.0 MB in the beginning and 196.1 MB in the end (delta: 45.1 MB). Free memory was 116.6 MB in the beginning and 99.7 MB in the end (delta: 16.9 MB). Peak memory consumption was 80.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 220.18 ms. Allocated memory is still 196.1 MB. Free memory was 99.7 MB in the beginning and 146.9 MB in the end (delta: -47.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 261.53 ms. Allocated memory is still 196.1 MB. Free memory was 146.9 MB in the beginning and 132.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * RCFGBuilder took 6134.43 ms. Allocated memory was 196.1 MB in the beginning and 252.7 MB in the end (delta: 56.6 MB). Free memory was 132.2 MB in the beginning and 179.2 MB in the end (delta: -47.0 MB). Peak memory consumption was 111.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 128302.74 ms. Allocated memory was 252.7 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 178.7 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 603.9 MB. Max. memory is 8.0 GB. * Witness Printer took 4.98 ms. Allocated memory is still 3.2 GB. Free memory is still 2.5 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: 127.8s, OverallIterations: 30, TraceHistogramMax: 2, AutomataDifference: 90.4s, 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, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 588 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2486 ImplicationChecksByTransitivity, 3.5s 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: 28.7s AutomataMinimizationTime, 29 MinimizatonAttempts, 246107 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 2.8s 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...